Method and apparatus of transmitting uplink signal

ABSTRACT

A method and apparatus for transmitting an uplink signal in a wireless communication system are discussed. The method includes multiplexing control information in all layers with a plurality of data blocks of the uplink signal; and transmitting the uplink signal to a base station, wherein the number of modulation symbols per layer for the control information is determined using a reciprocal of a sum of spectral efficiencies for respective data blocks of the plurality of data blocks, and a spectral efficiency for a data block is obtained based on a ratio of a size of the data block to the number of resource elements (REs) for an initial physical uplink shared channel (PUSCH) transmission of the data block.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of co-pending U.S. patent applicationSer. No. 14/244,702 filed on Apr. 3, 2014, which is a continuation ofU.S. patent application Ser. No. 13/574,525, filed on Jul. 20, 2012 (nowU.S. Pat. No. 8,873,493 issued on Oct. 28, 2014), which is the NationalPhase of PCT/KR2011/002634 filed on Apr. 13, 2011, which claims thebenefit of U.S. Provisional Application Nos. 61/323,843 filed on Apr.13, 2010; 61/324,291 filed on Apr. 14, 2010; 61/366,909 filed on Jul.22, 2010; 61/369,080 filed on Jul. 30, 2010 and claims benefit to KoreanPatent Application No. 10-2011-0030166 filed in Republic of Korea, onApr. 1, 2011. The contents of all of these applications are herebyincorporated by reference as fully set forth herein in their entirety.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a wireless communication system, andmore particularly to an apparatus and method for transmitting controlinformation.

2. Discussion of the Related Art

Wireless communication systems are widely used to provide various kindsof communication services such as voice or data services. Generally, awireless communication system is a multiple access system that cancommunicate with multiple users by sharing available system resources(bandwidth, transmission (Tx) power, and the like). A variety ofmultiple access systems can be used, for example, a Code DivisionMultiple Access (CDMA) system, a Frequency Division Multiple Access(FDMA) system, a Time Division Multiple Access (TDMA) system, anOrthogonal Frequency Division Multiple Access (OFDMA) system, a SingleCarrier Frequency Division Multiple Access (SC-FDMA) system, aMulti-Carrier Frequency Division Multiple Access (MC-FDMA) system, andthe like.

SUMMARY OF THE INVENTION

Accordingly, the present invention is directed to a method and apparatusfor transmitting an uplink signal that substantially obviate one or moreproblems due to limitations and disadvantages of the related art.

An object of the present invention devised to solve the problem lies ona method and apparatus for effectively transmitting an uplink signal ina wireless communication system. Another object of the present inventiondevised to solve the problem lies on a method and apparatus foreffectively transmitting control information. A further object of thepresent invention devised to solve the problem lies on a method andapparatus for effectively multiplexing control information and data.

It is to be understood that objects to be achieved by the presentinvention are not limited to the aforementioned objects and otherobjects which are not mentioned will be apparent to those of ordinaryskill in the art to which the present invention pertains from thefollowing description.

The object of the present invention can be achieved by providing amethod for transmitting an uplink signal by a communication apparatus ina wireless communication system, the method including channel encodingcontrol information; and multiplexing the channel encoded controlinformation with a plurality of data blocks by performing channelinterleaving, wherein the number of channel encoded symbols for thecontrol information is determined using an inverse number of the sum ofa plurality of spectral efficiencies (SEs) for initial transmission ofthe plurality of data blocks.

In another aspect of the present invention, provided herein is acommunication apparatus for transmitting an uplink signal in a wirelesscommunication system including a radio frequency (RF) unit, and aprocessor, wherein the processor channel-encodes control information,and performs channel interleaving, such that the channel encoded controlinformation is multiplexed with a plurality of data blocks, and thenumber of channel encoded symbols for the control information isdetermined using an inverse number of the sum of a plurality of spectralefficiencies (SEs) for initial transmission of the plurality of datablocks.

The spectral efficiency (SE) for initial transmission of each data blockis given as the following equation:

$\frac{{Payload}_{Data}}{\lambda \cdot N_{{RE\_ PUSCH}_{initial}}}$

where, Payload_(Data) is a size of a data block, N_(RE) _(_) _(PUSCH)_(initial) is the number of resource elements (REs) for initial PhysicalUplink Shared Channel (PUSCH) transmission of the data block, and λ isan integer of 1 or higher.

The number of channel encoded symbols for the control information isdetermined by the following equation:

$\left\lceil {\frac{{Payload}_{UCI}}{\alpha} \cdot \frac{1}{{\lambda_{1}^{\prime} \cdot {SE}_{{Data}{(1)}}} + {\lambda_{2}^{\prime} \cdot {SE}_{{Data}{(2)}}} + \ldots + {\lambda_{(N)}^{\prime} \cdot {SE}_{{Data}{(N)}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil$

where, Payload_(UCI) is a size of the control information, SE_(Data(i))is a spectral efficiency for initial transmission of an i-th data block,β_(offset) ^(PUSCH) is an offset value, α is an integer of 1 or higher,λ′_(i) is a constant, N is a total number of data blocks, and ┌ ┐ is aceiling function.

The number of channel encoded symbols for the control information isdetermined by the following equation:

$\left\lceil {\frac{{Payload}_{UCI}}{\alpha} \cdot \frac{\lambda_{1} \cdot N_{{RE\_ PUSCH}{(1)}_{initial}} \cdot \lambda_{2} \cdot N_{{RE\_ PUSCH}{(2)}_{initial}}}{\begin{matrix}{{{Payload}_{{Data}{(1)}} \cdot \lambda_{2} \cdot N_{{RE\_ PUSCH}{(2)}_{initial}}} +} \\{{Payload}_{{Data}{(2)}} \cdot \lambda_{1} \cdot N_{{RE\_ PUSCH}{(1)}_{initial}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}} \right\rceil$

where, Payload_(UCI) is a size of the control information,Payload_(Data(1)) is a size of a first data block, N_(RE) _(_)_(PUSCH(1)) _(initial) is the number of resource elements (REs) forinitial PUSCH transmission of a first data block, Payload_(Data(2)) is asize of a second data block, N_(RE) _(_) _(PUSCH(2)) _(initial) is thenumber of resource elements (REs) for initial PUSCH transmission of thesecond data block, β_(offset) ^(PUSCH) is an offset value, α is aninteger of 1 or higher, λ₁ is an integer of 1 or higher, and λ₂ is aninteger of 1 or higher, and ┌ ┐ is a ceiling function.

N_(RE) _(_) _(PUSCH(i)) _(initial) is denoted by N_(RE) _(_) _(PUSCH(i))_(initial) =M_(sc) ^(PUSCH(i)-initial)·N_(symb) ^(PUSCH(i)-initial), anda size of an i-th data block is denoted by

${\sum\limits_{r = 0}^{C^{i} - 1}K_{r}^{i}},$

where, M_(sc) ^(PUSCH(i)-initial) is the number of scheduled subcarriersfor initial PUSCH transmission of the i-th data block, N_(symb)^(PUSCH(i)-initial) is the number of SC-FDMA symbols for initial PUSCHtransmission of the i-th data block, C^((i)) is the number of codeblocks of the i-th data block, K_(r) ^((i)) is a size of r-th code blockof the i-th data block, and r is an integer of 0 or higher.

N is set to 2 (N=2), α is set to 1 (α=1), λ₁ is set to 1 (λ₁=1), and λ₂is set to 1 (λ₂=1).

The control information is acknowledgement/negative acknowledgement(ACK/NACK) or Rank Indicator (RI).

In another aspect of the present invention, provided herein is a methodfor transmitting an uplink signal by a communication apparatus in awireless communication system, the method including: channel encodingcontrol information; and multiplexing the channel encoded controlinformation with one of a plurality of data blocks by performing channelinterleaving, wherein the number of channel encoded symbols for thecontrol information is determined by the following equation:

$\alpha \cdot \left\lceil \frac{{Payload}_{UCI} \cdot N_{{RE\_ PUSCH}{(x)}_{initial}} \cdot \beta_{offset}^{PUSCH}}{{Payload}_{{Data}{(x)}}} \right\rceil$

where, α is an integer of 1 or higher, Payload_(UCI) is a size of thecontrol information, N_(RE) _(_) _(PUSCH(x)) _(initial) is the number ofresource elements (REs) for initial Physical Uplink Shared Channel(PUSCH) transmission of a data block x, β_(offset) ^(PUSCH) is an offsetvalue, and ┌ ┐ is a ceiling function. The data block x denotes a datablock having a highest Modulation and Coding Scheme (MCS) index forinitial transmission from among the plurality of data blocks, anddenotes a first data block when the plurality of data blocks have a sameMCS index for initial transmission.

In another aspect of the present invention, provided herein is acommunication apparatus for transmitting an uplink signal including aradio frequency (RF) unit; and a processor, wherein the processorchannel-encodes control information, and performs channel interleaving,such that the channel encoded control information is multiplexed with aplurality of data blocks, and the number of channel encoded symbols forthe control information is determined by the following equation:

$\alpha \cdot \left\lceil \frac{{Payload}_{UCI} \cdot N_{{RE}\; \_ \; {{PUSCH}{(x)}}_{initial}} \cdot \beta_{offset}^{PUSCH}}{{Payload}_{{Data}{(x)}}} \right\rceil$

where, α is an integer of 1 or higher, Payload_(UCI) is a size of thecontrol information, N_(RE) _(_) _(PUSCH(x)) _(initial) is the number ofresource elements (REs) for initial Physical Uplink Shared Channel(PUSCH) transmission of a data block x, β_(offset) ^(PUSCH) is an offsetvalue, and ┌ ┐ is a ceiling function, wherein the data block x denotes adata block having a highest Modulation and Coding Scheme (MCS) index forinitial transmission from among the plurality of data blocks, anddenotes a first data block when the plurality of data blocks have a sameMCS index for initial transmission.

N_(RE) _(_) _(PUSCH(x)) _(initial) is denoted by N_(RE) _(_) _(PUSCH(x))_(initial) =M_(sc) ^(PUSCH(x)-initial)·N_(symb) ^(PUSCH(x)-initial), anda size of the data block x is denoted by

${\sum\limits_{r = 0}^{C^{(x)} - 1}\; K_{r}^{(x)}},$

where M_(sc) ^(PUSCH(x)-initial) is the number of scheduled subcarriersfor initial PUSCH transmission of the data block x, N_(symb)^(PUSCH(x)-initial) is the number of SC-FDMA symbols for initial PUSCHtransmission of the data block x, C^((x)) is the number of code blocksof the data block x, K_(r) ^((x)) is a size of r-th code block of thedata block x, and r is an integer of 0 or higher.

α is set to 1 (α=1).

The control information may include information related to channelquality.

The control information may include at least one of a Channel QualityIndicator (CQI) and a Precoding Matrix Indicator (PMI).

Exemplary embodiments of the present invention have the followingeffects.

The method and apparatus for transmitting an uplink signal according tothe present invention can effectively transmit an uplink signal in awireless communication system. In addition, control information and datacan be effectively multiplexed.

It is to be understood that the advantages that can be obtained by thepresent invention are not limited to the aforementioned advantages andother advantages which are not mentioned will be apparent from thefollowing description to the person with an ordinary skill in the art towhich the present invention pertains.

BRIEF DESCRIPTION OF DRAWINGS

The accompanying drawings, which are included to provide a furtherunderstanding of the invention, illustrate embodiments of the inventionand together with the description serve to explain the principle of theinvention.

In the drawings:

FIG. 1 is a block diagram illustrating a Multiple Input Multiple Output(MIMO) transceiver.

FIG. 2 exemplarily shows a radio frame structure.

FIG. 3 exemplarily shows a resource grid of a downlink (DL) slot.

FIG. 4 is a downlink (DL) subframe structure.

FIG. 5 is an uplink (UL) subframe structure.

FIG. 6 is a flowchart illustrating a process for processing UL-SCH dataand control information.

FIG. 7 is a conceptual diagram illustrating that control information andUL-SCH data are multiplexed on a Physical Uplink Shared CHannel (PUSCH).

FIGS. 8 and 9 illustrate that Uplink Control Information (UCI) ismultiplexed to one specific codeword according to one embodiment of thepresent invention.

FIG. 10 exemplarily shows a DCI structure and a User Equipment (UE)analysis according to one embodiment of the present invention.

FIGS. 11 to 14 exemplarily show that UCI is multiplexed to a pluralityof codewords according to one embodiment of the present invention.

FIG. 15 is a block diagram illustrating a Base Station (BS) and a UserEquipment (UE) applicable to embodiments of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

Reference will now be made in detail to the preferred embodiments of thepresent invention with reference to the accompanying drawings. Thedetailed description, which will be given below with reference to theaccompanying drawings, is intended to explain exemplary embodiments ofthe present invention, rather than to show the only embodiments that canbe implemented according to the invention. The following embodiments ofthe present invention can be applied to a variety of wireless accesstechnologies, for example, CDMA, FDMA, TDMA, OFDMA, SC-FDMA, MC-FDMA,and the like. CDMA can be implemented by wireless communicationtechnologies, such as Universal Terrestrial Radio Access (UTRA) orCDMA2000. TDMA can be implemented by wireless communicationtechnologies, for example, a Global System for Mobile communications(GSM), a General Packet Radio Service (GPRS), an Enhanced Data rates forGSM Evolution (EDGE), etc. OFDMA can be implemented by wirelesscommunication technologies, for example, IEEE 802.11 (Wi-Fi), IEEE802.16 (WiMAX), IEEE 802.20, E-UTRA (Evolved UTRA), and the like. UTRAis a part of a Universal Mobile Telecommunications System (UMTS). 3rdGeneration Partnership Project (3GPP) Long Term Evolution (LTE) is apart of an Evolved UMTS (E-UMTS) that uses an E-UTRA. The LTE Advanced(LTE-A) is an evolved version of 3GPP LTE.

Although the following embodiments of the present invention willhereinafter describe inventive technical characteristics on the basis ofthe 3GPP LTE/LTE-A system, it should be noted that the followingembodiments will be disclosed only for illustrative purposes and thescope and spirit of the present invention are not limited thereto.Specific terms used for the exemplary embodiments of the presentinvention are provided to aid in understanding of the present invention.These specific terms may be replaced with other terms within the scopeand spirit of the present invention.

FIG. 1 is a block diagram illustrating a Multiple Input Multiple Output(MIMO) transceiver. In more detail, FIG. 1 shows an example of an OFDMor SC-FDMA (also called ‘DFT spread OFDM’ or ‘DFT-s-OFDM’) transceiverfor supporting MIMO. In FIG. 1, if a Discrete Fourier Transform (DFT)block 108 is not present, the transceiver shown in FIG. 1 is an OFDMtransceiver. If the DFT block 108 is present, the transceiver shown inFIG. 1 is an SC-FDMA transceiver. For convenience of description,description of FIG. 1 is based on the operations of a transmitter, andthe order of operations of a receiver is in reverse order to that of thetransmitter operations.

Referring to FIG. 1, a codeword-to-layer mapper 104 maps N_(C) codewords102 to N_(L) layers 106. A codeword (CW) is equivalent to a transportblock (TB) received from a Medium Access Control (MAC) layer. Therelationship between the transport block (TB) and the codeword (CW) maybe changed by codeword swapping. In general, the number of ranks for usein a communication system is identical to the number of layers. In theSC-FDMA transmitter, the DFT block 108 performs DFT conversion precodingfor each layer 106. The precoding block 110 multiplies N_(L)DFT-converted layers by a precoding vector/matrix. Through theabove-mentioned process, the precoding block 110 maps N_(L)DFT-converted layers to N_(T) Inverse Fast Fourier Transform (IFFT)blocks 112 and N_(T) antenna ports 114. The antenna port 114 may bere-mapped to actual physical antennas.

FIG. 2 exemplarily shows a radio frame structure.

Referring to FIG. 2, a radio frame includes 10 subframes, and onesubframe includes two slots in a time domain. A time required fortransmitting one subframe is defined as a Transmission Time Interval(TTI). For example, one subframe may have a length of 1 ms and one slotmay have a length of 0.5 ms. One slot may include a plurality ofOrthogonal Frequency Division Multiplexing (OFDM) symbols or a SingleCarrier Frequency Division Multiple Access (SC-FDMA) symbols in a timedomain. Since the LTE system uses OFDMA in downlink and uses SC-FDMA inuplink, the OFDM or SC-FDMA symbol indicates one symbol duration. Aresource block (RB) is a resource allocation unit and includes aplurality of contiguous carriers in one slot. The structure of the radioframe is only exemplary. Accordingly, the number of subframes includedin the radio frame, the number of slots included in the subframe or thenumber of symbols included in the slot may be changed in variousmanners.

FIG. 3 exemplarily shows a resource grid of a downlink slot.

Referring to FIG. 3, a downlink slot includes a plurality of OFDMsymbols in a time domain. One downlink slot includes 7 (or 6) OFDMsymbols and a resource block (RB) includes 12 subcarriers in a frequencydomain. Each element on a resource grid may be defined as a resourceelement (RE). One RB includes 12×7 (or 12×6) REs. The number (N_(RB)) ofRBs contained in a downlink slot is dependent upon a downlinktransmission bandwidth. An uplink slot structure is identical to thedownlink slot structure, but OFDM symbols are replaced with SC-FDMAsymbols in the uplink slot structure differently from the downlink slotstructure.

FIG. 4 is a downlink subframe structure.

Referring to FIG. 4, a maximum of three (or four) OFDM symbols locatedin the front part of a first slot of the subframe may correspond to acontrol region to which a control channel is allocated. The remainingOFDM symbols correspond to a data region to which a Physical DownlinkShared CHannel (PDSCH) is allocated. A variety of downlink controlchannels may be used in the LTE, for example, a Physical Control FormatIndicator Channel (PCFICH), a Physical Downlink Control Channel (PDCCH),a Physical hybrid ARQ indicator Channel (PHICH), etc. PCFICH istransmitted from a first OFDM symbol of the subframe, and carriesinformation about the number of OFDM symbols used for transmitting acontrol channel within the subframe. PHICH carries a Hybrid AutomaticRepeat request acknowledgment/negative-acknowledgment (HARQ ACK/NACK)signal as a response to an uplink transmission signal.

Control information transmitted over a PDCCH is referred to as DownlinkControl Information (DCI). DCI includes resource allocation informationfor either a UE or a UE group and other control information. Forexample, DCI includes uplink/downlink (UL/DL) scheduling information, anuplink transmission (UL Tx) power control command, etc.

PDCCH carries a variety of information, for example, transmission formatand resource allocation information of a downlink shared channel(DL-SCH), transmission format and resource allocation information of anuplink shared channel (UL-SCH), paging information transmitted over apaging channel (PCH), system information transmitted over the DL-SCH,resource allocation information of an upper-layer control message suchas a random access response being transmitted over PDSCH, a set of Txpower control commands of each UE contained in a UE group, a Tx powercontrol command, activation indication information of Voice over IP(VoIP), and the like. A plurality of PDCCHs may be transmitted within acontrol region. A user equipment (UE) can monitor a plurality of PDCCHs.PDCCH is transmitted as an aggregation of one or more contiguous controlchannel elements (CCEs). CCE is a logical allocation unit that is usedto provide a coding rate based on a radio channel state to a PDCCH. CCEmay correspond to a plurality of resource element groups (REGs). Theformat of PDCCH and the number of PDCCH bits may be determined accordingto the number of CCEs. A base station (BS) decides a PDCCH formataccording to DCI to be sent to the UE, and adds a Cyclic RedundancyCheck (CRC) to control information. The CRC is masked with an identifier(e.g., Radio Network Temporary Identifier (RNTI)) according to a PDCCHowner or a purpose of the PDCCH. For example, provided that the PDCCH isprovided for a specific UE, an identifier of the corresponding UE (e.g.,cell-RNTI (C-RNTI)) may be masked with the CRC. If PDCCH is provided fora paging message, a paging identifier (e.g., paging-RNTI (P-RNTI)) maybe masked with a CRC. If PDCCH is provided for system information (e.g.,system information block (SIC)), system information RNTI (SI-RNTI) maybe masked with CRC. If PDCCH is provided for a random access response,random access-RNTI (RA-RNTI) may be masked with CRC. Control informationtransmitted over PDCCH is referred to as downlink control information(DCI). DCI includes resource allocation information for a UE or a UEgroup and other control information. For example, DCI includes UL/DLscheduling information, an uplink Tx power control command, etc.

Table 1 shows a DCI format 0 for uplink scheduling. In Table 1, althoughthe size of the RB allocation field is denoted by 7 bits, the scope orspirit of the present invention is not limited thereto, the actual sizeof the RB allocation field can be changed according to system bandwidth.

TABLE 1 Field Bits Comment Format 1 Uplink grant or downlink assignmentHopping flag 1 Frequency hopping on/off RB assignment  7^(a)) Resourceblock assigned for PUSCH MCS 5 Modulation scheme, coding scheme, etc.New Data Indicator 1 Toggled for each new transport block TPC 2 Powercontrol of PUSCH Cyclic shift for 3 Cyclic shift of demodulationreference signal DMRS CQI request 1 To request CQI feedback throughPUSCH RNTI/CRC 16  16 bit RNTI implicitly encoded in CRC Padding 1 Toensure format 0 matches format 1A in size Total 38  — MCS: Modulationand Coding Scheme TPC: Transmit (Tx) Power Control RNTI: Radio NetworkTemporary Identifier CRC: Cyclic Redundancy Check

Table 2 shows information of an MCS index for enabling the LTE totransmit uplink (UL) data. 5 bits are used for MCS. Three states(I_(MCS)=29˜31) from among several states, each of which is capable ofbeing denoted by 5 bits, are used for uplink (UL) retransmission.

TABLE 2 MCS Modulation TBS Redundancy Index Order Index Version I_(MCS)Q_(m)′ I_(TBS) rv_(idx) 0 2 0 0 1 2 1 0 2 2 2 0 3 2 3 0 4 2 4 0 5 2 5 06 2 6 0 7 2 7 0 8 2 8 0 9 2 9 0 10 2 10 0 11 4 10 0 12 4 11 0 13 4 12 014 4 13 0 15 4 14 0 16 4 15 0 17 4 16 0 18 4 17 0 19 4 18 0 20 4 19 0 216 19 0 22 6 20 0 23 6 21 0 24 6 22 0 25 6 23 0 26 6 24 0 27 6 25 0 28 626 0 29 reserved 1 30 2 31 3

FIG. 5 is an uplink subframe structure for use in the LTE.

Referring to FIG. 5, the UL subframe includes a plurality of slots(e.g., 2 slots). Each slot may include different numbers of SC-FDMAsymbols according to CP length. The UL subframe is divided into a dataregion and a control region in a frequency domain. The data regionincludes PUCCH and transmits a data signal such as a voice signal or thelike. The control region includes PUCCH, and transmits Uplink ControlInformation (UCI). PUCCH includes a pair of RBs (hereinafter referred toas an RB pair) located at both ends of the data region on a frequencyaxis, and is hopped using a slot as a boundary.

PUCCH may be used to transmit the following control information, i.e.,Scheduling Request (SR), HARQ ACK/NACK, and a Channel Quality Indicator(CQI), and a detailed description thereof will hereinafter be described.

-   -   Scheduling Request (SR): Scheduling request (SR) is used for        requesting UL-SCH resources, and is transmitted using an On-Off        Keying (OOK) scheme.    -   HARQ ACK/NACK: HARQ ACK/NACK is a response signal to an uplink        (UL) data packet on a PDSCH. The HARQ ACK/NACK indicates whether        or not a DL data packet has been successfully received. ACK/NACK        of 1 bit is transmitted as a response to a single DL codeword,        and ACK/NACK of 2 bits is transmitted as a response to two DL        codewords.    -   Channel Quality Indicator (CQI): CQI is feedback information for        a downlink channel. MIMO-associated feedback information        includes a Rank Indicator (RI) and a Precoding Matrix Indicator        (PMI). 20 bits are used per subframe. The amount of control        information (i.e., UCI), that is capable of being transmitted in        a subframe by the UE, is dependent upon the number of SC-FDMAs        available for UCI transmission. SC-FDMAs available in UCI        transmission indicate the remaining SC-FDMA symbols other than        SC-FDMA symbols that are used for Reference Signal (RS)        transmission in a subframe. In the case of a subframe in which a        Sounding Reference Signal (SRS) is established, the last SC-FDMA        symbol of the subframe is also excluded. The Reference Signal        (RS) is used for coherent detection of a PUCCH. PUCCH supports 7        formats according to transmission information.

Table 3 shows the mapping relationship between PUCCH format and UCI foruse in LTE.

TABLE 3 PUCCH Format Uplink Control Information (UCI) Format 1Scheduling request (SR) (unmodulated waveform) Format 1a 1-bit HARQACK/NACK with/without SR Format 1b 2-bit HARQ ACK/NACK with/without SRFormat 2 CQI (20 coded bits) Format 2 CQI and 1- or 2-bit HARQ ACK/NACK(20 bits) for extended CP only Format 2a CQI and 1-bit HARQ ACK/NACK(20 + 1 coded bits) Format 2b CQI and 2-bit HARQ ACK/NACK (20 + 2 codedbits)

In LTE-A, two methods may be used to simultaneously transmit UCI andUL-SCH data. A first method simultaneously transmits PUCCH and PUSCH. Asecond method multiplexes UCI to a PUSCH in the same manner as in thelegacy LTE.

Since the legacy LTE UE is unable to simultaneously transmit PUCCH andPUSCH, it multiplexes UCI to a PUSCH region when UCI (e.g., CQI/PMI,HARQ-ACK, RI, etc.) transmission is needed for a subframe via whichPUSCH is transmitted. For example, provided that CQI and/or PMI(CQI/PMI) transmission is needed for a subframe to which PUSCHtransmission is allocated, the UE multiplexes UL-SCH data and CQI/PMIprior to DFT spreading, and then simultaneously transmits controlinformation and data over PUSCH.

FIG. 6 is a flowchart illustrating a process for processing UL-SCH dataand control information.

Referring to FIG. 6, error detection is provided to a UL-SCH transportblock (TB) through Cyclic Redundancy Check (CRC) attachment at stepS100.

All the transport blocks (TBs) are used to calculate CRC parity bits.Transport Block (TB) bits are denoted by a₀, a₁, a₂, a₃, . . . ,a_(A-1). Parity bits are denoted by p₀, p₁, p₂, p₃, . . . , p_(L-1). Thesize of TBs is denoted by A, and the number of parity bits is denoted byL.

After performing transport block (TB) CRC attachment, code blocksegmentation and code block CRC attachment are performed at step S110.Input bits for code block segmentation are denoted by b₀, b₁, b₂, b₃, .. . , b_(B-1), where B denotes the number of bits of a TB (includingCRC). Bits provided after code block segmentation are denoted by c_(r0),c_(r1), c_(r2), c_(r3), . . . , c_(r(K) _(r) ₋₁₎, where r denotes a codeblock number (r=0, 1, . . . , C−1) Kr denotes the number of bits of acode block (r), and C denotes a total number of code blocks.

The channel coding is performed after performing the code blocksegmentation and code block CRC attachment at step S120. Bits afterchannel coding are denoted by d_(r0) ^((i)), d_(r1) ^((i)), d_(r2)^((i)), d_(r3) ^((i)), . . . , d_(r(D) _(r) ₋₁₎ ^((i)), where i=0, 1, 2.D_(r) is the number of bits of an i-th coded stream for the code block(r) (i.e., D_(r)=K_(r)+4), r denotes a code block number (r=0, 1, . . ., C−1), and Kr denotes the number of bits of a code block (r). C denotesa total number of code blocks. Turbo coding may be used for such channelcoding.

Rate matching may be performed after the channel coding at step S130.Bits provided after rate matching are denoted by e_(r0), e_(r1), e_(r2),e_(r3), . . . , e_(r(E) _(r) ₋₁₎. E_(r) is the number of rate-matchedbits of the r-th code block (where r=0, 1, . . . , C−1), and C is atotal number of code blocks.

Code block concatenation is performed after the at step S140. Bitsprovided after the code block concatenation are denoted by f₀, f₁, f₂,f₃, . . . , f_(G-1). G denotes a total number of bits coded for datatransmission. If control information is multiplexed with UL-SCHtransmission, bits used for control information transmission are notincluded in ‘G’. f₀, f₁, f₂, f₃, . . . , f_(G-1) may correspond toUL-SCH codewords.

In the case of UL control information, channel quality information (CQIand/or PMI), RI and HARQ-ACK are independently channel-coded. UCIchannel coding is performed on the basis of the number of coded symbolsfor each piece of control information. For example, the number of codedsymbols may be used for rate matching of the coded control information.In a subsequent process, the number of coded symbols may correspond tothe number of modulation symbols or the number of REs.

Channel coding of channel quality information is performed using aninput bit sequence o₀, o₁, o₂, . . . , o_(O-1) at step S150. The outputbit sequence of the channel coding for channel quality information isdenoted by q₀, q₁, q₂, q₃, . . . , q_(Q) _(QCI) ₋₁, Channel qualityinformation uses different channel coding schemes according to thenumber of bits. In addition, if channel quality information is composedof 11 bits or more, a CRC bit is attached to the channel qualityinformation. Q_(QCI) is a total number of coded bits. In order to setthe length of a bit sequence to Q_(CQI), the coded channel qualityinformation may be rate-matched. Q_(CQI) is denoted byQ_(CQI)=Q′_(CQI)×Q_(m), Q′_(CQI) is the number of coded symbols for aCQI, Q_(m) is a modulation order, and Q_(m) is set to be identical to amodulation order of UL-SCH data.

Channel coding of RI is performed using an input bit sequence [o₀ ^(RI)]or [o₀ ^(RI) o₁ ^(RI)] at step S160. [o₀ ^(RI)] and [o₀ ^(RI) o₁ ^(RI)]denote 1-bit RI and 2-bit RI, respectively.

In the case of the 1-bit RI, repetition coding is used. In the case ofthe 2-bit RI, the (3,2) simplex code is used, and the encoded data maybe cyclically repeated.

Table 4 exemplarily shows channel coding of the 1-bit RI, and Table 5exemplarily shows channel coding.

TABLE 4 Q_(m) Encoded RI 2 [o₀ ^(RI) y] 4 [o₀ ^(RI) y x x] 6 [o₀ ^(RI) yx x x x]

TABLE 5 Q_(m) Encoded RI 2 [o₀ ^(RI) o₁ ^(RI) o₂ ^(RI) o₀ ^(RI) o₁ ^(RI)o₂ ^(RI)] 4 [o₀ ^(RI) o₁ ^(RI) xx o₂ ^(RI) o₀ ^(RI) xx o₁ ^(RI) o₂ ^(RI)xx] 6 [o₀ ^(RI) o₁ ^(RI) xxxx o₂ ^(RI) o₀ ^(RI) xxxx o₁ ^(RI) o₂ ^(RI)xxxx]

In Tables 4 and 5, Q_(m) is a modulation order. o₂ ^(RI) is denoted byo₂ ^(RI)=(o₀ ^(RI)+o₁ ^(RI))mod 2, and ‘mod’ is a modulo operation. ‘x’or ‘ y’ is a place holder for maximizing a Euclidean distance of amodulation symbol carrying RI information when the RI bit is scrambled.Each of ‘x’ and ‘ y’ has the value of 0 or 1. The output bit sequence q₀^(RI), q₁ ^(RI), q₂ ^(RI), . . . , q_(Q) _(RI) ₋₁ ^(RI) is obtained by acombination of coded RI block(s). Q_(RI) is a total number of codedbits. In order to set the length of coded RI to Q_(RI), thefinally-combined coded RI block may be a part not the entirety (i.e.,rate matching). Q_(RI) is denoted by Q_(RI)=Q′_(RI)×Q_(m), Q′_(RI) isthe number of coded symbols for RI, and Q_(m) is a modulation order.Q_(m) is established to be identical to a modulation order of UL-SCHdata.

The channel coding of HARQ-ACK is performed using the input bit sequence[o₀ ^(ACK)], [o₀ ^(ACK) o₁ ^(ACK)] or [o₀ ^(ACK) o₁ ^(ACK) . . . o_(O)_(ACK) ₋₁ ^(ACK)]. [o₀ ^(ACK)] and [o₀ ^(ACK) o₁ ^(ACK)] denote 1-bitHARQ-ACK and 2-bit HARQ-ACK. In addition, [o₀ ^(ACK) o₁ ^(ACK) . . .o_(O) _(ACK) ₋₁ ^(ACK)] denotes HARQ-ACK composed of two or more bits(i.e., O^(ACK)>2). ACK is encoded to 1, and NACK is encoded to 0. In thecase of 1-bit HARQ-ACK, repetition coding is used. In the case of 2-bitHARQ-ACK, the (3,2) simplex code is used, and encoded data may becyclically repeated.

Table 6 exemplarily shows channel coding of HARQ-ACK. Table 7exemplarily shows channel coding of 2-bit HARQ-ACK.

TABLE 6 Encoded Q_(m) HARQ-ACK 2 [o₀ ^(ACK) y] 4 [o₀ ^(ACK) y x x] 6 [o₀^(ACK) y x x x x]

TABLE 7 Q_(m) Encoded HARQ-ACK 2 [o₀ ^(ACK) o₁ ^(ACK) o₂ ^(ACK) o₀^(ACK) o₁ ^(ACK) o₂ ^(ACK)] 4 [O₀ ^(ACK) O₁ ^(ACK) XX O₂ ^(ACK) O₀^(ACK) XX O₁ ^(ACK) O₂ ^(ACK) XX] 6 [o₀ ^(ACK) o₁ ^(ACK) xxxx o₂ ^(ACK)o₀ ^(ACK) xxxx o₁ ^(ACK) o₂ ^(ACK) xxxx]

In Tables 6 and 7, Q_(m) is a modulation order. For example, Q_(m)=2 maycorrespond to QPSK, Q_(m)=4 may correspond to 16QAM, and Q_(m)=6 maycorrespond to 64QAM. o₀ ^(ACK) may correspond to an ACK/NACK bit for acodeword 0, and o₁ ^(ACK) may correspond to an ACK/NACK bit for acodeword 1. o₂ ^(ACK) is denoted by o₂ ^(ACK)=(o₀ ^(ACK)+o₁ ^(ACK))mod2, and ‘mod’ is a modulo operation. ‘x’ or ‘y’ is a place holder formaximizing a Euclidean distance of a modulation symbol carrying HARQ-ACKinformation when the HARQ-ACK bit is scrambled. Each of ‘x’ and ‘y’ hasthe value of 0 or 1. Q_(ACK) is a total number of coded bits, the bitsequence q₀ ^(ACK), q₁ ^(ACK), q₂ ^(ACK), . . . , q_(Q) _(ACK) ₋₁ ^(ACK)is obtained through a combination of coded HARQ-ACK block(s). In orderto set the length of the bit sequence to Q_(ACK), the finally-combinedHARQ-ACK block may be a part not the entirety (i.e., rate matching).Q_(ACK) is denoted by Q_(ACK)=Q′_(ACK)×Q_(m), Q′_(ACK) is the number ofcoded symbols for HARQ-ACK, Q_(m) is a modulation order. Q_(m) isestablished to be identical to a modulation order of UL-SCH data.

The inputs of a data and control multiplexing block (also called‘data/control multiplexing block’) are coded UL-SCH bits denoted by f₀,f₁, f₂, f₃, . . . , f_(G-1) and coded CQI/PMI bits denoted by q₀, q₁,q₂, q₃, . . . , q_(Q) _(CQI) ₋₁ at step S180. The outputs of the dataand control multiplexing block are denoted by g ₀, g ₁, g ₂, g ₃, . . ., g _(H′-1). g _(i) is a column vector of the length Q_(m) (where i=0, .. . , H′−1) H′ is denoted by H′=H/Q_(m), and H is denoted byH=(G+Q_(CQI)). H is the total number of coded bits allocated for UL-SCHdata and CQI/PMI data.

The input of a channel interleaver includes output data g ₀, g ₁, g ₂, .. . , g _(H′-1) of the data and control multiplexing block, the encodedrank indicators q ₀ ^(RI), q ₁ ^(RI), q ₂ ^(RI), . . . , q _(Q′) _(RI)₋₁ ^(RI) and coded HARQ-ACK data q ₀ ^(ACK), q ₁ ^(ACK), q ₂ ^(ACK), . .. , q _(Q′) _(ACK) ₋₁ ^(ACK) at step S190. g _(i) is a column vector oflength Q_(m) for CQI/PMI (where i=0, . . . , H′−1, and H′ is denoted byH′=H/Q_(m)), and q _(i) ^(ACK) is a column vector of length Q_(m) forACK/NACK (where i=0, . . . , Q′_(ACK)−1, and Q′_(ACK)=Q_(ACK)/Q_(m)). q_(i) ^(RI) is a column vector of length Q_(m) for RI (where i=0, . . . ,Q′_(RI)−1, and Q′_(RI)=Q_(RI)/Q_(m)).

The channel interleaver multiplexes control information and UL-SCH datafor PUSCH transmission. In more detail, the channel interleaver includesa process of mapping control information and UL-SCH data to a channelinterleaver matrix corresponding to PUSCH resources.

After execution of channel interleaving, the bit sequence h₀, h₁, h₂, .. . , h_(H+Q) _(RI) ₋₁ that is read row by row from the channelinterleaver matrix is then output. The read bit sequence is mapped on aresource grid. H″=H′+Q′_(RI) modulation symbols are transmitted througha subframe. FIG. 7 is a conceptual diagram illustrating that controlinformation and UL-SCH data are multiplexed on a PUSCH. Whentransmitting control information in a subframe to which PUSCHtransmission is allocated, the UE simultaneously multiplexes controlinformation (UCI) and UL-SCH data prior to DFT spreading. The controlinformation (UCI) includes at least one of CQI/PMI, HARQ ACK/NACK andRI. The number of REs used for transmission of each of CQI/PMI, ACK/NACKand RI is dependent upon Modulation and Coding Scheme (MCS) and offsetvalues (Δ_(offset) ^(CQI), Δ_(offset) ^(HARQ-ACK), Δ_(offset) ^(RI))assigned for PUSCH transmission. The offset values allow differentcoding rates according to control information, and are semi-staticallyestablished by an upper layer (e.g., RRC) signal. UL-SCH data andcontrol information are not mapped to the same RE. Control informationis mapped to be contained in two slots of the subframe. A base station(BS) can pre-recognize control transmission to be transmitted overPUSCH, such that it can easily demultiplex control information and adata packet.

Referring to FIG. 7, CQI and/or PMI (CQI/PMI) resources are located atthe beginning part of UL-SCH data resources, are sequentially mapped toall SC-FDMA symbols on one subcarrier, and are finally mapped in thenext subcarrier. CQI/PMI is mapped from left to right within eachsubcarrier (i.e., in the direction of increasing SC-FDMA symbol index).PUSCH data (UL-SCH data) is rate-matched in consideration of the amountof CQI/PMI resources (i.e., the number of encoded symbols). Themodulation order identical to that of UL-SCH data may be used inCQI/PMI. If the CQI/PMI information size (payload size) is small (e.g.,11 bits or less), the CQI/PMI information may use the (32, k) block codein a similar manner to PUCCH transmission, and the encoded data may becyclically repeated. If CQI/PMI information is small in size, CRC is notused. If CQI/PMI information is large in size (e.g., 11 bits or higher),8-bit CRC is added thereto, and channel coding and rate matching areperformed using a tail-biting convolutional code. ACK/NACK is insertedinto some resources of the SC-FDMA mapped to UL-SCH data throughpuncturing. ACK/NACK is located close to RS, fills the correspondingSC-FDMA symbol from bottom to top (i.e., in the direction of increasingsubcarrier index) within the SC-FDMA symbol. In case of a normal CP, theSC-FDMA symbol for ACK/NACK is located at SC-FDMA symbols (#2/#4) ineach slot as can be seen from FIG. 7. Irrespective of whether ACK/NACKis actually transmitted in a subframe, the encoded RI is located next tothe symbol for ACK/NACK. Each of ACK/NACK, RI and CQI/PMI isindependently encoded.

In LTE, control information (e.g., QPSK modulated) may be scheduled in amanner that the control information can be transmitted over PUSCHwithout UL-SCH data. Control information (CQI/PMI, RI and/or ACK/NACK)is multiplexed before DFT spreading so as to retain low CM (CubicMetric) single-carrier characteristics. Multiplexing of ACK/NACK, RI andCQI/PMI is similar to that of FIG. 7. The SC-FDMA symbol for ACK/NACK islocated next to RS, and resources mapped to the CQI may be punctured.The number of REs for ACK/NACK and the number of REs for RI aredependent upon reference MCS (CQI/PMI MCS) and offset parameters(Δ_(offset) ^(CQI), Δ_(offset) ^(HARQ-ACK), and Δ_(offset) ^(RI)). Thereference MCS is calculated on the basis of CQI payload size andresource allocation. Channel coding and rate matching to implementcontrol signaling having no UL-SCH data are identical to those of theother control signaling having UL-SCH data.

If UCI is transmitted over PUSCH, the UE must determine the numberQ′_(UCI) of encoded symbols for UCI so as to perform channel coding (SeeS150, S160 and S170 of FIG. 6). The number Q′_(UCI) of encoded symbolsis adapted to calculate a total number (Q_(UCI)=Q_(m)·Q′_(UCI)) ofencoded bits. In case of CQI/PMI and RI, the number of encoded symbolsmay also be used for rate matching of UL-SCH data. Q_(m) is a modulationorder. In the case of LTE, a modulation order of UCI is established tobe identical to a modulation order of UL-SCH data. In a subsequentprocess, the number (Q′_(UCI)) of encoded symbols may correspond to thenumber of modulation symbols or the number of REs multiplexed on PUSCH.Therefore, according to the present invention, the number (Q′_(UCI)) ofencoded symbols may be replaced with the number of (encoded) modulationsymbols or the number of REs.

A method for deciding the number (Q′) of encoded symbols for UCI inlegacy LTE will hereinafter be described using CQI/PMI as an example.Equation 1 indicates an equation defined in LTE.

                                     [Equation  1]$Q^{\prime} = {\min\left( {{(1)\left\lceil \frac{\left( {O + L} \right) \cdot M_{sc}^{{PUSCH} - {initial}} \cdot N_{symb}^{{PUSCH} - {initial}} \cdot \beta_{offset}^{PUSCH}}{\sum\limits_{r = 0}^{C - 1}\; K_{r}} \right\rceil},{{(2){M_{sc}^{PUSCH} \cdot N_{symb}^{PUSCH}}} - \frac{Q_{RI}}{Q_{m}}}} \right)}$

In Equation 1, ‘0’ denotes the number of CQI/PMI bits, and ‘L’ denotesthe number of CRC bits. If ‘O’ is equal to or less than 11, L is set to0. If ‘O’ is higher than 12, L is set to 8. Q_(CQI) is denoted byQ_(CQI)=Q_(m)·Q′, and Q_(m) is a modulation order. Q_(RI) denotes thenumber of encoded RI bits. If RI is not transmitted, Q_(RI) is set to 0(Q_(RI)=0) β_(offset) ^(PUSCH) denotes an offset value, and may beadapted to adjust the coding rate of CQI/PMI. β_(offset) ^(PUSCH) mayalso be denoted by β_(offset) ^(PUSCH)=β_(offset) ^(CQI). M_(sc)^(PUSCH-initial) is a band that is scheduled for initial PUSCHtransmission of a transport block (TB). N_(symb) ^(PUSCH-initial) is thenumber of SC-FDMA symbols for each subframe for initial PUSCHtransmission of the same transport block (TB), and may also be denotedby N_(symb) ^(PUSCH-initial)=(2·(N_(symb) ^(UL)−1)−N_(SRS)). N_(symb)^(UL) denotes the number of SC-FDMA symbols for each slot, N_(SRS) is 0or 1. In the case where the UE is configured to transmit PUSCH and SRSin a subframe for initial transmission or in the case where PUSCHresource allocation for initial transmission partially or entirelyoverlaps with a cell-specific SRS subframe or band, N_(SRS) is set to 1.Otherwise, N_(SRS) is set to 0.

$\sum\limits_{r = 0}^{C - 1}\; K_{r}$

denotes the number of bits of data payload (including CRC) for initialPUSCH transmission of the same transport block (TB). C is a total numberof code blocks, r is a code block number, and K_(r) is the number ofbits of a code block (r). M_(sc) ^(PUSCH-initial), C, and K_(r) areobtained from initial PDCCH for the same transport block (TB). ┌n┐ is aceiling function, and returns the smallest integer from among at least nvalues. ‘min(a,b)’ returns the smallest one of ‘a’ and ‘b’.

The part (2) for an upper limit is removed from Equation 1, but only thepart (1) can be represented by the following equation 2.

                                     [Equation  2] $\begin{matrix}{Q^{\prime} = \left\lceil {\frac{\left( {O + L} \right)}{1} \cdot \frac{1}{\sum\limits_{r = 0}^{C - 1}\; {{K_{r}/M_{sc}^{{PUSCH} - {initial}}} \cdot N_{symb}^{{PUSCH} - {initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} \\{= \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{\begin{matrix}{{Payload}_{Data}/} \\N_{{RE}\; \_ \; {PUSCH}_{initial}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}\end{matrix}$

In Equation 2, Payload_(UCI) is the sum of the number (O) of UCI bitsand the number (L) of CRC bits (i.e., Payload_(UCI)=O+L). In legacy LTE,if UCI is ACK/NACK or RI, the number (L) of CRC bits is set to 0. If UCIis CQI/PMI and the CQI/PMI is composed of 11 bits or less, L is set to 0(i.e., L=0). Otherwise, if UCI is CQI/PMI and the CQI/OMI is composed of12 bits or higher, L is set to 8 (i.e., L=8). Payload_(Data) is thenumber of bits of data payload (including CRC) for initial PUSCHtransmission recognized through either initial PDCCH or a random accessresponse grant for the same transport block (TB). N_(RE) _(_) _(PUSCH)_(initial) is the number of REs allocated to PUSCH for initialtransmission of the same transport block (TB) (corresponding to N_(sc)^(PUSCH-initial)·N_(symb) ^(PUSCH-initial)). β_(offset) ^(PUSCH) is anoffset value for adjusting the coding rate of UCI. β_(offset) ^(PUSCH)may be determined on the basis of a given offset value (e.g., Δ_(offset)^(CQI), Δ_(offset) ^(HARQ-ACK), Δ_(offset) ^(RI)) for each UCI.

In Equation 2, Payload_(Data)/N_(RE) _(_) _(PUSCH) _(initial) is aSpectral Efficiency (SE) for initial PUSCH transmission of the sametransport block (TB). That is, the SE may indicate the ratio of the sizeof resources physically used by specific information to information tobe transmitted. The unit of SE is bit/symbol/subcarrier or bit/RE, andcorresponds to a bit/second/Hz acting as a general SE unit. The SE canbe understood as the number of data bits allocated to one PUSCH RE so asto perform initial PUSCH transmission of the same transport block (TB).Equation 2 reuses SE of UL-SCH data so as to calculate the number ofcoded symbols of UCI, and uses an offset value to adjust the codingrate.

In the legacy LTE, when PUCCH is piggybacked, a modulation order (Q_(m))of UCI is established to be identical to a modulation order (Q_(m)) ofdata. Under this condition, Equation 2 can be represented by thefollowing equation 3.

$\begin{matrix}\begin{matrix}{Q^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{\frac{{Payload}_{Data}}{N_{{RE}\; \_ \; {PUSCH}_{initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} \\{= \left\lceil {\frac{{Payload}_{UCI}}{Q_{m}} \cdot \frac{1}{\frac{{Payload}_{Data}}{Q_{m} \cdot N_{{RE}\; \_ \; {PUSCH}_{initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}\end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 3} \right\rbrack\end{matrix}$

In Equation 3, Payload_(Data)/Q_(m)·N_(RE) _(_) _(PUSCH) _(initial) isthe ratio of the number (Payload_(Data)) of bits (including CRC) of datapayload for initial PUSCH transmission of the same transport block (TB)to the number (Q_(m)·N_(RE) _(_) _(PUSCH) _(initial) ) of bits allocatedto a PUSCH for initial transmission of the same transport block (TB).Payload_(Data)/Q_(m)·N_(RE) _(_) _(PUSCH) _(initial) may approximate toa spectral efficiency (SE) of initial transmission of the same transportblock (TB).

In the present invention, SE is a spectral efficiency (SE_(Data)) forUL-SCH data (i.e., a transport block (TB)) in so far as the SE is notmentioned specially in a different manner. SE may also denote orPayload_(Data)/N_(RE) _(_) _(PUSCH) _(initial) orPayload_(Data)/Q_(m)·N_(RE) _(_) _(PUSCH) _(initial) according tocontext.

In the case of HARQ-ACK, L is set to 0 (i.e., L=0), β_(offset) ^(PUSCH)is set to β_(offset) ^(PUSCH-ACK) (i.e., β_(offset) ^(PUSCH)=β_(offset)^(HARQ-ACK)), and the number of coded symbols is determined in the samemanner as in Equation 1 other than the part (2) indicating the upperlimit. Similarly, in the case of RI, L is set to 0 (i.e., L=0),β_(offset) ^(PUSCH) is set to β_(offset) ^(RI) (i.e., β_(offset)^(PUSCH)=βoffset^(RI)), and the number of coded symbols is determined inthe same manner as in Equation 1 other than the part (2) indicating theupper limit.

The above-mentioned description may be applied only when one codeword(corresponding to a TB) is transmitted over a PUSCH, because the legacyLTE does not support a single user (SU)-MIMO. However, LTE-A supportsSU-MIMO, so that several codewords can be transmitted over a PUSCH.Therefore, a method for multiplexing a plurality of codewords and UCI isneeded.

A method for effectively multiplexing several pieces of data and UCI ina PUSCH will hereinafter be described with reference to the annexeddrawing. For convenience of description, although UL-SCH transmissionwill be described on the basis of a codeword, a transport block (TB) anda codeword are equivalent data blocks. Therefore, the equivalent datablocks may be commonly known as ‘UL-SCH data block’. In addition, thecodeword may be replaced with a corresponding transport block (TB), orvice versa. The relationship between the codeword and the transportblock (TB) may be changed by codeword swapping. For example, a first TBand a second TB may correspond to a first codeword and a secondcodeword, respectively. On the other hand, if codeword swapping isapplied, the first TB may correspond to the second codeword, and thesecond TB may correspond to the first codeword. The HARQ operation isperformed on the basis of a transport block (TB). The followingembodiments may be implemented independently or collectively.

Embodiment 1A UCI is Multiplexed to One Codeword Through CodewordSelection

In accordance with the present invention, when two or more codewords aretransmitted, UCI is multiplexed to a layer via which a specific codewordis transmitted so that the multiplexed result is transmitted.Preferably, a specific codeword may be selected according to informationof a new data indicator (NDI) capable of discriminating between newtransmission (or initial transmission) and retransmission. UCI ismultiplexed to all or some of a layer via which the correspondingcodeword is transmitted.

For example, in the case where two codewords are all in new transmission(or initial transmission), UCI may be multiplexed to a layer via which afirst codeword (or a transport block TB) is transmitted. In anotherexample, in the case where one of two codewords corresponds to newtransmission and the other one corresponds to retransmission (i.e., acodeword of new transmission and a codeword of retransmission aremixed), UCI may be multiplexed to a layer via which a codeword of newtransmission is transmitted. Preferably, the size of resources (e.g.,the number of REs) (corresponding to the number of modulation symbols orthe number of coded symbols) where the UCI is multiplexed may be decidedaccording to the number of REs via which the corresponding codeword istransmitted, the modulation scheme/order, the number of bits of datapayload, and an offset value. Preferably, in order for UCI resources tobe determined to be an MCS (Modulation and Coding Scheme) function ofthe corresponding codeword, UCI can be multiplexed to all layers fortransmitting the corresponding codeword.

In the case where the new transmission and the retransmission arepresent, the reason why the UCI is multiplexed to the codewordcorresponding to the new transmission is as follows. In HARQ initialtransmission, a data transport block size (TBS) of a PUSCH isestablished to satisfy a target Frame Error Rate (FER) (e.g., 10%).Therefore, when data and UCI are multiplexed and transmitted, the numberof REs for the UCI is defined as a function of the number of REsallocated for transmission of both a data TBS and a PUSCH, as shown inEquation 2. On the other hand, when UCI is multiplexed to a PUSCHretransmitted by HARQ, the UCI can be multiplexed using a parameterhaving been used for initial PUSCH transmission. In order to reduceresource consumption during transport block (TB) retransmission, the BSmay allocate a smaller amount of PUSCH resources as compared to theinitial transmission, such that there may arise an unexpected problemwhen the size of UCI resources is decided by a parameter correspondingto retransmission. Accordingly, in the case where HARQ retransmissionoccurs, the size of UCI resources may be determined using a parameterused for initial PUSCH transmission. However, assuming that there is ahigh difference in channel environment between initial transmission andretransmission in association with the same codeword, transmissionquality of UCI may be deteriorated when the size of UCI resources isdecided using the parameter used for initial PUSCH transmission.Therefore, the retransmission codeword and the initial transmissioncodeword are simultaneously transmitted, UCI is multiplexed to aninitial transmission codeword, so that the amount of UCI resources canbe adaptively changed even when the channel environment is changed.

In another example, if all codewords correspond to retransmission, twomethods can be used. A first method can be implemented by multiplexing aUCI to a first codeword (or TB). A second method can be implemented bymultiplexing a UCI to a codeword to which the latest UCI wasmultiplexed. In this case, the amount of UCI resources can be calculatedusing either information of a codeword related to the latest initialtransmission or information of a codeword that has been retransmittedthe smallest number of times, such that UCI resources can be mostappropriately adapted to channel variation.

Embodiment 1B UCI is Multiplexed to One Codeword Through CodewordSelection

In accordance with embodiment 1B, in the case where one of two codewordscorresponds to new transmission, and the other one corresponds toretransmission (i.e., a new transmission codeword and a retransmissioncodeword are mixed), UCI may be multiplexed to a layer via which theretransmission codeword is transmitted. In the case of using asuccessive interface cancellation (SIC) receiver, a retransmissioncodeword having a high possibility of causing rapid termination is firstdecoded and at the same time that UCI is decoded, and interferenceaffecting the new transmission codeword can be removed using the decodedretransmission codeword. Provided that the base station (BS) uses theSIC receiver, if UCI is multiplexed to a layer via which the newtransmission codeword is transmitted (See Embodiment 1A), latency forenabling the BS to read UCI may be unavoidably increased. The methodshown in the embodiment 1B can be implemented by multiplexing UCI to afirstly decoded codeword on the condition that the SIC receiver canrecognize the firstly decoded codeword. On the other hand, provided thatUCI is transmitted to a layer via which a new transmission codeword istransmitted under the condition that new transmission and retransmissionare mixed, information corresponding to retransmission is first decoded,and interference is removed from the layer via which the newtransmission codeword is transmitted, thereby improving UCI detectionperformance.

If the UCI is multiplexed to a specific codeword, the correspondingcodeword can be transmitted to a plurality of layers, so that UCI canalso be multiplexed to a plurality of layers.

Equation 4 exemplarily shows a method for calculating the number (Q′) ofcoded symbols for UCI under the condition that the UCI is multiplexed toone specific codeword.

$\begin{matrix}\begin{matrix}{Q^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{{SE}_{Data}/L_{Data}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} \\{= \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{\frac{{Payload}_{Data}}{L_{Data} \cdot N_{{RE}\; \_ \; {PUSCH}_{initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} \\{= \left\lceil \frac{{Payload}_{UCI} \cdot L_{Data} \cdot N_{{RE}\; \_ \; {PUSCH}_{initial}} \cdot \beta_{offset}^{PUSCH}}{{Payload}_{Data}} \right\rceil}\end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 4} \right\rbrack\end{matrix}$

In Equation 4, SE_(Data) is a spectral efficiency (SE), and is given asPayload_(Data)/N_(RE) _(_) _(PUSCH) _(initial) . Payload_(UCI),Payload_(Data), N_(RE) _(_) _(PUSCH) _(initial) and β_(offset) ^(PUSCH)are defined in Equation 2. L_(Data) is an integer of 1 or higher, anddenotes the number of layers for the same transport block (TB) (orcorresponding codeword). UCI includes CQI/PMI, HARQ ACK/NACK or RI.

Equation 4 is characterized in that a payload size of a codeword viawhich UCI is multiplexed, the number of REs via which the correspondingcodeword is transmitted, and the number (L_(Data)) of layers via whichthe corresponding codeword is transmitted are used to decide the numberof encoded symbols for UCI. In more detail, the number of layers for UCImultiplexing is multiplied by the number of time-frequency resourceelements (REs), such that a total number of time-frequency-space REs canbe applied to the process of calculating UCI resources.

FIG. 8 shows an example in which UCI is multiplexed to one specificcodeword using the number of encoded symbols obtained from Equation 4.The method of FIG. 8 can effectively use PUSCH resources by multiplexingUCI using only the number of resources requisite for each layer. In theexample of FIG. 8, it is assumed that UCI is multiplexed to a secondcodeword. Referring to FIG. 8, the amounts of UCI resources multiplexedto respective layers are different from each other.

Equation 5 exemplarily shows another method for calculating the number(Q′) of encoded symbols for UCI when the UCI is multiplexed to onespecific codeword.

$\begin{matrix}\begin{matrix}{Q^{\prime} = {L_{UCI} \cdot \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{{SE}_{Data}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} \\{= {L_{UCI} \cdot \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{\frac{{Payload}_{Data}}{N_{{RE}\; \_ \; {PUSCH}_{initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} \\{= {L_{UCI} \cdot \left\lceil {\frac{{Payload}_{UCI}}{Q_{m}} \cdot \frac{1}{\frac{{Payload}_{Data}}{Q_{m} \cdot N_{{RE}\; \_ \; {PUSCH}_{initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} \\{= {L_{UCI} \cdot \left\lceil \frac{{Payload}_{UCI} \cdot N_{{RE}\; \_ \; {PUSCH}_{initial}} \cdot \beta_{offset}^{PUSCH}}{{Payload}_{Data}} \right\rceil}}\end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 5} \right\rbrack\end{matrix}$

In Equation 5, SE_(Data) denotes a spectral efficiency (SE), and isgiven as Payload_(Data)/N_(RE) _(_) _(PUSCH) _(initial) orPayload_(Data)/Q_(m)·N_(RE) _(_) _(PUSCH) _(initial) . Q_(m) is amodulation order. Although Equation 5 shows that Q_(m) for UCI isidentical to Q_(m) for data, it should be noted that Q_(m) for UCI andQ_(m) for data may also be given independent of each other.Payload_(UCI), Payload_(Data), N_(RE) _(_) _(PUSCH) _(initial) , Q_(m)and β_(offset) ^(PUSCH) shown in Equation 5 are the same as those ofEquation 2. L_(UCI) is an integer of 1 or higher, and denotes the numberof layers in which UCI is multiplexed. UCI includes CQI/PMI, HARQACK/NACK or RI.

In the same manner as in Equation 4, Equation 5 is also characterized inthat a payload size of a codeword via which UCI is multiplexed, and thenumber of REs via which the corresponding codeword is transmitted areused to decide the number of encoded symbols for the UCI. Differentlyfrom Equation 4, Equation 5 is used to calculate the number of resourceswhere UCI is multiplexed (i.e., the number of encoded symbols), and thenumber of layers where UCI is multiplexed is multiplied by thecalculated number of resources. Therefore, the number of UCI resourcesin all layers where UCI is multiplexed is given as the same number.

FIG. 9 shows another example in which UCI is multiplexed to one specificcodeword using the number of encoded symbols obtained from Equation 5.The method of FIG. 9 can multiplex UCI using the same number ofresources within each layer. The above-mentioned example of FIG. 9 maybe helpful to a base station (BS) that uses the SIC receiver. In theexample of FIG. 9, it is assumed that UCI is multiplexed to a pluralityof layers for a second codeword. Referring to FIG. 9, the amounts of UCIresources multiplexed to respective layers are identical to each other.

Embodiment 1C UCI is Multiplexed to One Codeword Through CodewordSelection

In accordance with the embodiment 1C), if several codewords (e.g., twocodewords) (or transport blocks TBs) are transmitted, UCI can bemultiplexed to a codeword (or a transport block TB) selected accordingto the following rules. Preferably, UCI includes channel stateinformation (or channel quality control information). For example, UCIincludes CQI and/or CQI/PMI.

Rule 1.1) CQI is multiplexed to a codeword (or a TB) having the highestI_(MCS). Referring to Table 2, the higher the I_(MCS) value, the betterthe channel state for the corresponding codeword (or TB). Accordingly,CQI is multiplexed to a codeword (or a TB) having the highest I_(MCS)value, such that reliability of transmitting channel state informationcan be increased.

Rule 1.2) If two codewords (or two TBs) have the same I_(MCS) value, CQIis multiplexed to Codeword 0 (i.e., a first codeword).

FIG. 10 exemplarily shows a DCI structure and a UE analysis according toone embodiment of the present invention. In more detail, FIG. 10exemplarily shows that DCI carries scheduling information for twotransport blocks (TBs).

FIG. 10(a) exemplarily shows some parts of a DCI format to be newlyadded for LTE-A uplink MIMO. Referring to FIG. 10(a), a DCI formatincludes an MCS field and an NDI field for a first transport block(CW0), includes an MCS field and an NDI field for a second transportblock (CW0), a PMI/RI field, a resource allocation field (N_PRB), and aCQI request field (CQI request).

FIG. 10(b) exemplarily shows that two transport blocks (or twocodewords) are transmitted and UCI (e.g., channel quality controlinformation) is multiplexed to one (or one codeword) of two transportblocks. Since each of CW0 and CW1 has an MCS of 28 or less and an NDIfield is toggled, this means that all of two transport blocks correspondto initial transmission. Since a CQI request field is set to 1 (CQIrequest=1), aperiodic CQI is multiplexed along with data. Although theCQI request field is set to 0 (CQI request=0), if periodic CQItransmission having PUSCH transmission is planned, the periodic CQI ismultiplexed along with data. CQI may include a CQI-only format or a(CQI+PMI) format. In this case, according to the above-mentioned rules,channel state information is multiplexed to a codeword (CW0) (or atransport block) having the highest I_(MCS) value.

FIG. 10(c) exemplarily shows that two transport blocks (or twocodewords) are transmitted and UCI (e.g., channel quality controlinformation) is multiplexed to one transport block (or one codeword).Since each of CW0 and CW1 has an MCS/RV of 28 or less and an NDI fieldis toggled, this means that all of two codewords (CW0 and CW1)correspond to initial transmission. Since a CQI request field is set to1 (CQI request=1), aperiodic CQI is multiplexed along with data.Although the CQI request field is set to 0 (CQI request=0), if periodicCQI transmission having PUSCH transmission is planned, the periodic CQIis multiplexed along with data. CQI may include a CQI-only format or a(CQI+PMI) format. In this case, according to the above-mentioned rules,since two transport blocks have the same I_(MCS) value, channel stateinformation is multiplexed to a codeword CW1 acting as a first transportblock.

Equations 6 and 7 exemplarily show methods for calculating the number(Q′) of encoded symbols for UCI when UCI is multiplexed to one specificcodeword according to the above-mentioned rules. Except for theabove-mentioned rules, Equations 6 and 7 are identical to Equations 4and 5.

$\begin{matrix}\begin{matrix}{Q^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{{SE}_{{Data}{(x)}}/L_{{Data}{(x)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} \\{= \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{\frac{{Payload}_{{Data}{(x)}}}{L_{{Data}{(x)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(x)}}_{initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} \\{= \left\lceil \frac{{Payload}_{UCI} \cdot L_{{Data}{(x)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(x)}}_{initial}} \cdot \beta_{offset}^{PUSCH}}{{Payload}_{{Data}{(x)}}} \right\rceil}\end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 6} \right\rbrack \\\begin{matrix}{Q^{\prime} = {L_{UCI} \cdot \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{{SE}_{{Data}{(x)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} \\{= {L_{UCI} \cdot \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{\frac{{Payload}_{{Data}{(x)}}}{N_{{RE}\; \_ \; {{PUSCH}{(x)}}_{initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} \\{= {L_{UCI} \cdot \left\lceil {\frac{{Payload}_{UCI}}{Q_{m}} \cdot \frac{1}{\frac{{Payload}_{{Data}{(x)}}}{Q_{m} \cdot N_{{RE}\; \_ \; {{PUSCH}{(x)}}_{initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} \\{= {L_{UCI} \cdot \left\lceil \frac{{Payload}_{UCI} \cdot N_{{RE}\; \_ \; {{PUSCH}{(x)}}_{initial}} \cdot \beta_{offset}^{PUSCH}}{{Payload}_{{Data}{(x)}}} \right\rceil}}\end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 7} \right\rbrack\end{matrix}$

In Equations 6 and 7, SE_(Data(x)) is a spectral efficiency (SE), and isgiven as Payload_(Data(x))/N_(RE) _(_) _(PUSCH(x)) _(initial) . Q_(m) isa modulation order. Although Equations 6 and 7 show that Q_(m) for UCIis identical to Q_(m) for data, it should be noted that Q_(m) for UCIand Q_(m) for data may also be given independent of each other. Exceptfor a subscript or superscript (x), Payload_(UCI), Payload_(Data(x)),N_(RE) _(_) _(PUSCH(x)) _(initial) (=M_(sc) ^(PUSCH(x)-initial)·N_(symb)^(PUSCH(x)-initial)), Q_(m) and β_(offset) ^(PUSCH) in Equations 6 and 7are the same as those of Equation 2. The subscript or superscript (x)indicates that the corresponding parameter is used for a transport blockx. The transport block x is determined by the above-mentioned rules 1.1)and 1.2). L_(Data(x)) is an integer of 1 or higher, and denotes thenumber of layers for use in the transport block x. L_(Data(x)) is aninteger of 1 or higher, and denotes the number of layers in which UCI ismultiplexed. For generalization, each of L_(UCI) and L_(Data(x)) can bereplaced with a constant (e.g., α, λ) indicating an integer of 1 orhigher. UCI includes CQI/PMI, HARQ ACK/NACK or RI. Preferably, UCI mayinclude CQI/PMI. CQI/PMI may represent a CQI-only format or a (CQI+PMI)format.

If the number of encoded symbols for UCI is the number of encodedsymbols for each layer or the rank is set to 1, L_(UCI)=L_(Data(x))=1 isestablished. Equation 1 of the legacy LTE can be modified into thefollowing Equation 8 according to the above-mentioned rules.

                                     [Equation  8]$Q^{\prime} = {\min\left( {\left\lceil \frac{\left( {O + L} \right) \cdot M_{sc}^{{{PUSCH}{(x)}} - {initial}} \cdot N_{symb}^{{{PUSCH}{(x)}} - {initial}} \cdot \beta_{offset}^{PUSCH}}{\sum\limits_{r = 0}^{C^{(x)} - 1}\; K_{r}^{(x)}} \right\rceil,{{M_{sc}^{PUSCH} \cdot N_{symb}^{PUSCH}} - \frac{Q_{RI}}{Q_{m}}}} \right)}$

In Equation 8, 0 is the number of CQI/PMI bits, and L is the number ofCRC bits. If O is 11 or less, L is set to 0. If O is 12 or higher, L isset to 8. Q_(CQI) is denoted by Q_(CQI)=Q_(m)·Q′, where Q_(m) is amodulation order. Q_(RI) is the number of encoded RI bits. If there isno RI transmission, Q_(RI) is set to 0 (Q_(RI)=0). β_(offset) ^(PUSCH)is an offset value, and may be used to adjust the coding rate ofCQI/PMI. β_(offset) ^(PUSCH) is given as β_(offset) ^(CQI) (i.e.,β_(offset) ^(PUSCH)=β_(offset) ^(CQI)). M_(sc) ^(PUSCH(x)-initial) is aband scheduled for initial PUSCH transmission of the transport block x,and is represented by the number of subcarriers. N_(symb)^(PUSCH(x)-initial) is the number of SC-FDMA symbols for each subframefor initial PUSCH transmission of the same transport block (i.e.,transport block x), and may also be denoted by N_(symb)^(PUSCH(x)-initial)=(2·(N_(symb) ^(UL)−1)−N_(SRS)). N_(symb) ^(UL) isthe number of SC-FDMA symbols for each slot, and N_(SRS) is 0 or 1. Inthe case where the UE is configured to transmit PUSCH and SRS in asubframe for initial transmission of the transport block x or in thecase where PUSCH resource allocation for initial transmission of thetransport block x partially or entirely overlaps with a cell-specificSRS subframe or band, N_(SRS) is set to 1. Otherwise, N_(SRS) is set to0.

$\sum\limits_{r = 0}^{C^{(x)} - 1}\; K_{r}^{(x)}$

is the number of bits of data payload (including CRC) for initial PUSCHtransmission of the same transport block (i.e., a transport block x).C^((x)) is a total number of code blocks for the transport block x, r isa code block number. K_(r) is the number of bits of the code block (r)for use in the transport block x. M_(sc) ^(PUSCH-initial), C, and K_(r)are obtained from initial PDCCH for the same transport block (i.e., atransport block x). The transport block x is determined according to theabove-mentioned rules 1.1) and 1.2). ┌n┐ is a ceiling function, andreturns the smallest integer from among at least n values. ‘min(a,b)’returns the smallest one of ‘a’ and ‘13’.

Embodiment 1D UCI is Multiplexed to One Codeword without CodewordSelection

In accordance with the embodiment 1D), UCI can be multiplexed to apredetermined codeword irrespective of new transmission (initialtransmission) or retransmission. In this case, parameters used forcalculating UCI resources can be partially or entirely updated even inthe case of retransmission through a UL grant or the like. In the legacyLTE, when UCI is multiplexed to retransmission PUSCH, the calculation ofUCI resources can be performed using information of the initial PUSCHtransmission. In contrast, if the UCI is multiplexed to a retransmissionPUSCH, UCI resources can be calculated using information ofretransmission PUSCH. If parameters used for the UCI resourcecalculation are changed due to a channel variation or the like duringthe retransmission, the embodiment 1D) of the present invention includesthe context indicating that the changed parameters are partially orentirely updated and used during the UCI resource calculation. Inaddition, if the number of layers via which the corresponding codewordis transmitted is changed during the retransmission, the embodiment 1D)of the present invention may also reflect the changed result to UCImultiplexing.

In accordance with the embodiment 1D), in Equation 4, N_(RE) _(_)_(PCUSCH) _(initial) may be changed to N_(RE) _(_) _(PCUSCH) _(latest)or N_(RE) _(_) _(PCUSCH) _(recent) , etc. N_(RE) _(_) _(PCUSCH)_(latest) or N_(RE) _(_) _(PCUSCH) _(recent) denotes the number of REsof the latest transmission PUSCH. In accordance with the embodiment 1D),since a codeword to which UCI is multiplexed is fixed, the embodiment 1Dcan be easily and simply implemented without codeword selection or thelike. In addition, MCS level variation caused by channel environmentvariation can be applied to UCI multiplexing, so that it can prevent UCIdecoding performance caused by channel variation from beingdeteriorated.

Embodiment 2A UCI is Multiplexed to all Codewords

The embodiment 2A provides a method for calculating the amount of UCIresources when UCI is multiplexed to all layers irrespective of thenumber of codewords. In more detail, the embodiment 2A) provides amethod for calculating the spectral efficiency (SE) of each codewordwithin a subframe via which UCI is transmitted, and calculating thenumber of encoded symbols for UCI using the sum of calculated SEs (or aninverse number of the sum of calculated SEs). SE of each codeword may becalculated using parameters for initial PUSCH transmission of the samecodeword.

Equation 9 exemplarily shows a method for calculating the number (Q′) ofencoded symbols for UCI when UCI is multiplexed to all layers.

                                     [Equation  9]$Q^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{Q_{mUCI}} \cdot \frac{1}{\begin{matrix}{\frac{{Payload}_{{Data}{(1)}}}{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}}} +} \\\frac{{Payload}_{{Data}{(2)}}}{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}} \right\rceil$

In Equation 9, Payload_(UCI) and β_(offset) ^(PUSCH) are identical tothose of Equation 2. UCI includes CQI/PMI, ACK/NACK or RI. Q_(mUCI) is amodulation order for the UCI. Q_(m(1)) is a modulation order of thefirst transport block, and Q_(m(2)) is a modulation order of the secondtransport block. Payload_(Data(1)) and Payload_(Data(2)) are associatedwith a first transport block and a second transport block, respectively,and denote the number of bits of data payload (including CRC) for eitherinitial PDCCH transmission for the corresponding transport block orinitial PUSCH transmission recognized through a random access responsegrant for the corresponding transport block. N_(RE) _(_) _(PCUSCH)_(initial) is the number of REs for allocated to PUSCH for initialtransmission of the first transport block (corresponding to N_(sc)^(PUSCH(1)-initial)·N_(symb) ^(PUSCH(1)-initial)). L_(Data(1)) orL_(Data(2)) is an integer of 1 or higher. L_(Data(1)) is the number oflayers for the first transport block, and L_(Data(2)) is the number oflayers for the second transport block.

Although Equation 9 assumes that Q_(mUCI), Q_(m(1)) and Q_(m(2)) aregiven independently of each other, Q_(mUCI)=Q_(m(1))=Q_(m(2)) may alsobe given in the same manner as in LTE. In this case, Equation 9 can besimplified as shown in the following equation 10.

                                     [Equation  10] $\begin{matrix}{Q^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{\begin{matrix}{\frac{{Payload}_{{Data}{(1)}}}{L_{{Data}{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}}} +} \\\frac{{Payload}_{{Data}{(2)}}}{L_{{Data}{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} \\{= \left\lceil \begin{matrix}{\frac{{Payload}_{UCI}}{1} \cdot} \\{\frac{\begin{matrix}{L_{{Data}{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}} \cdot} \\{L_{{Data}{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}}\end{matrix}}{\begin{matrix}{{{Payload}_{{Data}{(1)}} \cdot L_{{Data}{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}} +} \\{{Payload}_{{Data}{(2)}} \cdot L_{{Data}{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}}\end{matrix} \right\rceil}\end{matrix}$

In addition, if the number (Q′) of encoded symbols for UCI may be thenumber of encoded symbols per layer, or if the rank is 2,L_(Data1)=L_(Data2)=1 is given so that Equation 10 can be simplified asshown in the following equation 10.

                                     [Equation  11] $\begin{matrix}{Q^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{1}{\frac{{Payload}_{{Data}{(1)}}}{N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}}} + \frac{{Payload}_{{Data}{(2)}}}{N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} \\{= \left\lceil {\frac{{Payload}_{UCI}}{1} \cdot \frac{N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}}{\begin{matrix}{{{Payload}_{{Data}{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}} +} \\{{Payload}_{{Data}{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}\end{matrix}$

Meanwhile, Equation 9 can be generalized as shown in the followingequation 12.

                                     [Equation  12] $\begin{matrix}{Q^{\prime} = \left\lceil {\begin{matrix}{\frac{{Payload}_{UCI}}{\alpha} \cdot} \\{\frac{1}{\frac{{Payload}_{{Data}{(1)}}}{\lambda_{1} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}}} + \frac{{Payload}_{{Data}{(2)}}}{\lambda_{2} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}}} \cdot}\end{matrix}\beta_{offset}^{PUSCH}} \right\rceil} \\{= \left\lceil \begin{matrix}{\frac{{Payload}_{UCI}}{\alpha} \cdot} \\{\frac{\lambda_{1} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}} \cdot \lambda_{2} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}}{\begin{matrix}{{{Payload}_{{Data}{(1)}} \cdot \lambda_{2} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{initial}}} +} \\{{Payload}_{{Data}{(2)}} \cdot \lambda_{1} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{initial}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}}\end{matrix} \right\rceil}\end{matrix}\mspace{641mu}\left\lbrack {{Equation}\mspace{14mu} 13} \right\rbrack$$\begin{matrix}{Q^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{\alpha} \cdot \frac{1}{{\lambda_{1}^{\prime} \cdot {SE}_{{Data}{(1)}}} + {\lambda_{2}^{\prime} \cdot {SE}_{{Data}{(2)}}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} \\\left. \Rightarrow \left\lceil {\frac{{Payload}_{UCI}}{\alpha} \cdot \frac{1}{\begin{matrix}{{\lambda_{1}^{\prime} \cdot {SE}_{{Data}{(1)}}} + {\lambda_{2}^{\prime} \cdot {SE}_{{Data}{(2)}}} + \ldots +} \\{\lambda_{N}^{\prime} \cdot {SE}_{{Data}{(N)}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}} \right\rceil \right.\end{matrix}$

In Equations 12 and 13, α or λ_(i) (i=1, . . . , N) is an integer of 1or higher. λ′_(i) is a constant, and is given as 1/λ_(i). SE_(Data(i))(where i=1, . . . , N) denotes a spectral efficiency (SE) for initialPUSCH transmission of the i-th transport block, and is given asPayload_(Data(i))/N_(RE) _(_) _(PUSCH(i)) _(initial) .

FIG. 11 exemplarily shows that UCI is multiplexed to all codewords usingthe number of encoded symbols obtained from Equation 9. The method ofFIG. 11 can effectively utilize PUSCH resources because only the numberof resources actually required for UCI multiplexing is used. As aresult, the amounts of UCI resources multiplexed to individual layersare different from each other as shown in FIG. 11. In FIG. 11, in thecase where a first codeword is mapped to one layer and a second codewordis mapped to two layers (i.e., rank=3), the number of codewords and thenumber of layers mapped to each codeword may be determined in variousways.

Equation 14 shows another method for calculating the number (Q′) ofencoded symbols for UCI when the UCI is multiplexed to all codewords.The method shown in Equation 14 calculates an average amount ofmultiplexed UCI resources on the basis of a layer, and multiplies thecalculated average amount by a total number of layers where UCI ismultiplexed. The following Equation 14 can also be modified in the samemanner as in Equations 10 to 13.

$\begin{matrix}{Q^{\prime} = {L_{UCI} \cdot \left\lceil {\frac{{Payload}_{UCI}}{L_{UCI} \cdot Q_{mUQI}} \cdot \frac{1}{\begin{matrix}{\frac{{Payload}_{{Data}{(1)}}}{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\\frac{{Payload}_{{Data}{(2)}}}{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} & \left\lbrack {{Equation}\mspace{14mu} 14} \right\rbrack\end{matrix}$

In Equation 14, Payload_(UCI), Payload_(Data(1)), Payload_(Data(2)),N_(RE) _(_) _(PUSCH(1)) _(initial) , N_(RE) _(_) _(PUSCH(2)) _(initial), Q_(mUCI), Q_(m(1)), Q_(m(2)), L_(Data(1)), L_(Data(2)), L_(UCI) andβ_(offset) ^(PUSCH) are the same as those of the aforementionedEquations. UCI includes CQI/PMI, ACK/NACK or RI.

FIG. 12 exemplarily shows that UCI is multiplexed to all codewords usingthe number of encoded symbols obtained from Equation 14. Referring toFIG. 12, the same amount of UCI resources is multiplexed to individuallayers. In other words, the same amount of resources used for UCImultiplexing is assigned to each of all the corresponding layers. Themethod of FIG. 12 may be helpful to a base station (BS) that uses theSIC receiver. In FIG. 12, although FIG. 12 exemplarily shows that afirst codeword is mapped to one layer and a second codeword is mapped totwo layers (i.e., Rank=3), it should be noted that the number ofcodewords and the number of layers mapped to individual codewords may bedetermined in various ways.

Equations 15 and 16 exemplarily show another method for calculating thenumber (Q′) of encoded symbols for UCI when the UCI is multiplexed toall codewords. The following Equation 14 may also be modified in thesame manner as in Equations 10 to 13.

$\begin{matrix}{Q^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{Q_{mUQI}} \cdot \begin{pmatrix}{\frac{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}}{{Payload}_{{Data}{(1)}}} +} \\\frac{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}{{Payload}_{{Data}{(2)}}}\end{pmatrix} \cdot \beta_{offset}^{PUSCH}} \right\rceil} & \left\lbrack {{Equation}\mspace{14mu} 15} \right\rbrack \\{Q^{\prime} = {L_{UCI} \cdot \left\lceil {\frac{{Payload}_{UCI}}{L_{UCI} \cdot Q_{mUQI}} \cdot \begin{pmatrix}{\frac{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}}{{Payload}_{{Data}{(1)}}} +} \\\frac{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}{{Payload}_{{Data}{(2)}}}\end{pmatrix} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} & \left\lbrack {{Equation}\mspace{14mu} 16} \right\rbrack\end{matrix}$

In Equations 15 and 16, Payload_(UCI), Payload_(Data(1)),Payload_(Data(2)), N_(RE) _(_) _(PUSCH(1)) _(initial) , N_(RE) _(_)_(PUSCH(2)) _(initial) , Q_(mUCI), Q_(m(1)), Q_(m(2)), L_(Data(1)),L_(Data(2)), L_(UCI) and β_(offset) ^(PUSCH) are the same as those ofthe aforementioned Equations. UCI includes CQI/PMI, ACK/NACK or RI.

Embodiment 2B UCI is Multiplexed to all Codewords

The embodiment 2B provides another method for calculating the amount ofUCI resources when UCI is multiplexed to all layers irrespective of thenumber of codewords. The embodiment 2B calculates the overall spectralefficiency (SE) of all codewords using parameters of initialtransmission of all the codewords in a subframe in which UCI istransmitted, and calculating the number of encoded symbols for UCI usingthe calculated overall SE.

Equations 17 and 18 illustrate values corresponding to N_(RE) _(_)_(PUSCH) _(initial) /Payload_(Data)(=1/SE_(Data)) shown in Equation 2,and illustrate utilization examples of

$\frac{\begin{matrix}{{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}{(1)}} + {Payload}_{{Data}{(2)}}}.$

The following Equations 17 and 18 can be modified in the same manner asin Equations 10 to 13.

$\begin{matrix}{Q^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{Q_{mUQI}} \cdot \frac{\begin{matrix}{{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}{(1)}} + {Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil} & \left\lbrack {{Equation}\mspace{14mu} 17} \right\rbrack \\{Q^{\prime} = {L_{UCI} \cdot \left\lceil {\frac{{Payload}_{UCI}}{L_{UCI} \cdot Q_{mUQI}} \cdot \frac{\begin{matrix}{{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}{(1)}} + {Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} & \left\lbrack {{Equation}\mspace{14mu} 18} \right\rbrack\end{matrix}$

In Equations 16 and 17, Payload_(UCI), Payload_(Data(1)),Payload_(Data(2)), N_(RE) _(_) _(PUSCH(1)) _(initial) , N_(RE) _(_)_(PUSCH(2)) _(initial) , Q_(mUCI), Q_(m(1)), Q_(m(2)), L_(Data(1)),L_(Data(2)), L_(UCI) and β_(offset) ^(PUSCH) are the same as those ofthe aforementioned Equations. UCI includes CQI/PMI, ACK/NACK or RI.

Embodiment 2C UCI is Multiplexed to all Codewords

The embodiment 2C provides another method for calculating the amount ofUCI resources when UCI is multiplexed to all layers irrespective of thenumber of codewords. The embodiment 2C provides a method for calculatingthe number of encoded symbols for UCI for each transport block. Ifdifferent codewords have different modulation orders, the embodiment 2Chas an advantage in that a modulation order for each codeword can beused as a modulation order of UCI.

Equations 19 and 20 exemplarily illustrate a method (Q′) for calculatingthe number of encoded symbols for UCI. The method shown in Equations 19and 20 can calculate the number (Q′₁, Q′₂, . . . , Q′_(N)) of encodedmodulation symbols for UCI for each transport block, as represented byQ′=Q′₁+Q′₂+ . . . +Q′_(N). If modulation orders for use in individualtransport blocks are different from one another, UCI uses a modulationorder (QPSK, 16QAM, or 64QAM) of the multiplexed transport block. Thefollowing Equations 19 and 20 can be modified in the same manner as inEquations 10 to 13.

$\begin{matrix}{{Q_{1}^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{Q_{m{(1)}}} \cdot \frac{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}}{{Payload}_{{Data}{(1)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}{Q_{2}^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{Q_{m{(2)}}} \cdot \frac{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}{{Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} & \left\lbrack {{Equatio}\; n\mspace{14mu} 19} \right\rbrack \\{{Q_{1}^{\prime} = {L_{{Data}{(1)}} \cdot \left\lceil {\frac{{Payload}_{UCI}}{Q_{m{(1)}}} \cdot \frac{Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}}{{Payload}_{{Data}{(1)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}}{Q_{2}^{\prime} = {L_{{Data}{(2)}} \cdot \left\lceil {\frac{{Payload}_{UCI}}{Q_{m{(2)}}} \cdot \frac{\cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}{{Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}}} & \left\lbrack {{Equation}\mspace{14mu} 20} \right\rbrack\end{matrix}$

In Equations 19 and 20, Payload_(UCI), Payload_(Data(1)),Payload_(Data(2)), N_(RE) _(_) _(PUSCH(1)) _(initial) , N_(RE) _(_)_(PUSCH(2)) _(initial) , Q_(mUCI), Q_(m(1)), Q_(m(2)), L_(Data(1)),L_(Data(2)), L_(UCI) and β_(offset) ^(PUSCH) are the same as those ofthe aforementioned Equations. UCI includes CQI/PMI, ACK/NACK or RI.

Equations 21 and 22 exemplarily illustrate a method for calculating thenumber (Q′) of encoded symbols for UCI. The method shown in Equations 21and 22 can calculate the number (Q′₁, Q′₂, . . . , Q′_(N)) of encodedmodulation symbols for UCI for each transport block, as represented byQ′=Q′₁+Q′₂+ . . . +Q′_(N). If modulation orders for use in individualtransport blocks are different from one another, UCI uses a modulationorder (QPSK, 16QAM, or 64QAM) of the multiplexed transport block. Thefollowing Equations 21 and 22 can be modified in the same manner as inEquations 10 to 13.

$\begin{matrix}{{Q_{1}^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{L_{UCI} \cdot Q_{m{(1)}}} \cdot \frac{\begin{matrix}{{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}{(1)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}{Q_{2}^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{L_{UCI} \cdot Q_{m{(2)}}} \cdot \frac{\begin{matrix}{{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} & \left\lbrack {{Equation}\mspace{14mu} 21} \right\rbrack \\{{Q_{1}^{\prime} = {L_{{Data}{(1)}} \cdot \left\lceil {\frac{{Payload}_{UCI}}{L_{UCI} \cdot Q_{m{(1)}}} \cdot \frac{\begin{matrix}{{Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}{(1)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}}{Q_{2}^{\prime} = {L_{{Data}{(2)}} \cdot \left\lceil {\frac{{Payload}_{UCI}}{L_{UCI} \cdot Q_{m{(2)}}} \cdot \frac{\begin{matrix}{{Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}}} & \left\lbrack {{Equation}\mspace{14mu} 22} \right\rbrack\end{matrix}$

In accordance with the method shown in Equations 21 and 22, Q′₁ UCImodulation symbols are multiplexed to a first transport block, and Q′₂UCI modulation symbols are multiplexed to a second transport block. InEquation 21, Q′₁ or Q′₂

denotes a total number of UCI modulation symbols multiplexed to eachcodeword, and numbers of UCI modulation symbols multiplexed toindividual layers within one codeword may be different from one another.On the other hand, as shown in Equation 22, Q′₁ or Q′₂ denotes anaverage number of UCI modulation symbols multiplexed to individuallayers, so that the same number of UCI modulation symbols is multiplexedto each layer within one codeword.

Embodiment 2D UCI are Multiplexed to all Codewords

The embodiment 2D provides a method for calculating the amount of UCIresources when UCI is multiplexed to all layers irrespective of thenumber of codewords. The embodiment 2D provides a method for calculatingthe number of encoded symbols for UCI for each transport block.Differently from the embodiment 2C, the embodiment 2D can calculate theratio of UCI resources multiplexed to each codeword using the number oflayers and modulation order of the corresponding codeword in a currenttransmission subframe. Equations 23 and 24 exemplarily illustrate amethod for calculating the number of encoded symbols for UCI accordingto the embodiment 2D. The embodiment 2D shown in Equations 23 and 24 cancalculate the number (Q′₁, Q′₂, . . . , Q′_(N)) of encoded modulationsymbols for UCI for each transport block, as represented by Q′=Q′₁+Q′₂+. . . +Q′_(N). Q′₁ or Q′₂ UCI modulation symbols are multiplexed to alayer to which the corresponding codeword is transmitted. If individualtransport blocks use different modulation orders, UCI may use amodulation order (QPSK, 16QAM, or 64QAM) of the multiplexed transportblock. The following equations 23 and 24 can be modified in the samemanner as in Equations 10 to 13.

$\begin{matrix}{{Q_{1}^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{Q_{{UCI}{(1)}}} \cdot \frac{L_{{UCI}{(1)}} \cdot Q_{{UCI}{(1)}}}{{L_{{UCI}{(1)}} \cdot Q_{{UCI}{(1)}}} + {L_{{UCI}{(1)}} \cdot Q_{{UCI}{(1)}}}} \cdot \frac{\begin{matrix}{{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}{(1)}} + {Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}{Q_{2}^{\prime} = \left\lceil {\frac{{Payload}_{UCI}}{Q_{{UCI}{(2)}}} \cdot \frac{L_{{UCI}{(2)}} \cdot Q_{{UCI}{(2)}}}{{L_{{UCI}{(1)}} \cdot Q_{{UCI}{(1)}}} + {L_{{UCI}{(2)}} \cdot Q_{{UCI}{(2)}}}} \cdot \frac{\begin{matrix}{{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}{(1)}} + {Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}} & \left\lbrack {{Equation}\mspace{14mu} 23} \right\rbrack \\{{Q_{1}^{\prime} = {L_{{UCI}{(1)}} \cdot \left\lceil {\frac{{Payload}_{UCI}}{{L_{{UCI}{(1)}} \cdot Q_{{UCI}{(1)}}} + {L_{{UCI}{(2)}} \cdot Q_{{UCI}{(2)}}}} \cdot \frac{\begin{matrix}{{L_{{Data}{(1)}} \cdot Q_{m\; 1} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}\; 1} + {Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}}{Q_{2}^{\prime} = {L_{{UCI}{(2)}} \cdot \left\lceil {\frac{{Payload}_{UCI}}{{L_{{UCI}{(1)}} \cdot Q_{{UCI}{(1)}}} + {L_{{UCI}{(2)}} \cdot Q_{{UCI}{(2)}}}} \cdot \frac{\begin{matrix}{{L_{{Data}{(1)}} \cdot Q_{m{(1)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{inital}}} +} \\{L_{{Data}{(2)}} \cdot Q_{m{(2)}} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{inital}}}\end{matrix}}{{Payload}_{{Data}\; {(1)}} + {Payload}_{{Data}{(2)}}} \cdot \beta_{offset}^{PUSCH}} \right\rceil}}} & \left\lbrack {{Equation}\mspace{14mu} 24} \right\rbrack\end{matrix}$

In Equations 23 and 24, Payload_(UCI), Payload_(Data(1)),Payload_(Data(2)), N_(RE) _(_) _(PUSCH(1)) _(initial) , N_(RE) _(_)_(PUSCH(2)) _(initial) , Q_(mUCI), Q_(m(1)), Q_(m(2)), L_(Data(1)),L_(Data(2)), L_(UCI) and β_(offset) ^(PUSCH) are the same as those ofthe aforementioned Equations 2 and 6. UCI includes CQI/PMI, ACK/NACK orRI. L_(UCI(1)) and L_(UCI(2)) denote the number of layers of a firsttransport block and the number of layers of a second transport block,respectively. Q_(UCI(1)) and Q_(UCI(2)) denote a modulation order of UCImultiplexed to a first transport block and a modulation order of UCImultiplexed to a second transport block, respectively.

FIGS. 13 to 14 exemplarily show that UCI is multiplexed to all codewordsusing the number of encoded symbols obtained from Equations 23 and 24.Referring to FIG. 13, Q′₁ UCI Part 1 modulation symbols are multiplexedto Codeword 1, and Q′₂ UCI Part 2 modulation symbols are multiplexed toCodeword 2. In accordance with Equation 23, Q′₁ or Q′₂ denotes a totalnumber of UCI modulation symbols multiplexed to each codeword, so thatnumbers of UCI modulation symbols multiplexed to individual layerswithin one codeword may be different from each other. On the other hand,as can be seen from Equation 22, Q′₁ or Q′₂ denotes an average number ofUCI modulation symbols multiplexed to individual layers within onecodeword, so that the same number of UCI modulation symbols ismultiplexed to each layer within one codeword.

In the embodiments 2A to 2D, the scope of a codeword where UCI can bemultiplexed is not limited according to UCI types. However, ACK/NACK ismultiplexed to all codewords, and CSI information such as CQI/PMI can bemultiplexed only to a specific codeword as shown in the embodiments 1Ato 1C.

The above-mentioned description does not disclose the upper limit and/orthe lower limit used for calculating the number of encoded symbols (Seethe part (2) of Equation 1), for convenience of description and betterunderstanding of the present invention. For example, after the number offinally determined encoded symbols is calculated through Equations 4 to24, the upper limit and/or the lower limit can be restricted in the samemanner as in Equation 1.

For convenience of description and better understanding of the presentinvention, the above-mentioned description has disclosed that the number(Q′) of encoded symbols for UCI is set to a total number of all symbols.In this case, Q_(UCI)=Q′_(UCI(total))·Q_(m) is obtained. Q_(UCI) is atotal number of encoded bits for UCI, Q′_(UCI(total)) is a total numberof encoded symbols for UCI. Q_(m) is a modulation order. In this case,the equation for calculating Q′_(UCI) includes parameters related to thenumber of layers as shown in the above-mentioned equations. On the otherhand, according to implementation methods, the number (Q′) of encodedsymbols for UCI may be determined on the basis of each layer. In thiscase, Q_(UCI)=L·Q′_(UCI(layer))·Q_(m) is obtained. In this case, L isthe number of layers where UCI is multiplexed (differently, the numberof layers mapped to a UCI-related transport block), Q′_(UCI(layer)) isthe number of encoded symbols for UCI for each layer. Q′_(UCI(layer)) isobtained by setting each of all the layer-related parameters shown inthe above-mentioned equations to 1.

FIG. 15 is a block diagram illustrating a Base Station (BS) and a UserEquipment (UE) applicable to embodiments of the present invention. If arelay is contained in a wireless communication system, a base station(BS) communicates with a relay in a backhaul link, and a relaycommunicates with a user equipment (UE) in an access link. Therefore,the BS or the UE may be replaced with the relay.

Referring to FIG. 15, a wireless communication system includes a BS 110and a UE 120. The BS 110 includes a processor 112, a memory 114, and anRF unit 116. The processor 112 may be configured so as to implement theprocedures and/or methods of the present invention. The memory 114 isconnected to the processor 112 and stores various pieces of informationrelated to operations of the processor 112. The RF unit 116 is connectedto the processor 112 and transmits and/or receives RF signals. The UE120 includes a processor 122, a memory 124, and an RF unit 126. Theprocessor 122 may be configured so as to implement the procedures and/ormethods of the present invention. The memory 124 is connected to theprocessor 122 and stores various pieces of information related tooperations of the processor 122. The RF unit 126 is connected to theprocessor 122 and transmits and/or receives RF signals. The BS 110and/or the UE 120 may have a single or multiple antennas.

The aforementioned embodiments are achieved by combination of structuralelements and features of the present invention in a predetermined type.Each of the structural elements or features should be consideredselectively unless specified separately. Each of the structural elementsor features may be carried out without being combined with otherstructural elements or features. Also, some structural elements and/orfeatures may be combined with one another to constitute the embodimentsof the present invention. The order of operations described in theembodiments of the present invention may be changed. Some structuralelements or features of one embodiment may be included in anotherembodiment, or may be replaced with corresponding structural elements orfeatures of another embodiment. Moreover, it will be apparent that someclaims referring to specific claims may be combined with another claimsreferring to the other claims other than the specific claims toconstitute the embodiment or add new claims by means of amendment afterthe application is filed.

The embodiments of the present invention have been described based onthe data transmission and reception between the base station and theuser equipment. A specific operation which has been described as beingperformed by the base station may be performed by an upper node of thebase station as the case may be. In other words, it will be apparentthat various operations performed for communication with the userequipment in the network which includes a plurality of network nodesalong with the base station can be performed by the base station ornetwork nodes other than the base station. The base station may bereplaced with terms such as a fixed station, Node B, eNode B (eNB), andaccess point. Also, the user equipment may be replaced with terms suchas mobile station (MS) and mobile subscriber station (MSS).

The embodiments according to the present invention can be implemented byvarious means, for example, hardware, firmware, software, or theircombination. If the embodiment according to the present invention isimplemented by hardware, the embodiment of the present invention can beimplemented by one or more application specific integrated circuits(ASICs), digital signal processors (DSPs), digital signal processingdevices (DSPDs), programmable logic devices (PLDs), field programmablegate arrays (FPGAs), processors, controllers, microcontrollers,microprocessors, etc.

If the embodiment according to the present invention is implemented byfirmware or software, the embodiment of the present invention may beimplemented by a type of a module, a procedure, or a function, whichperforms functions or operations described as above. Software code maybe stored in a memory unit and then may be driven by a processor. Thememory unit may be located inside or outside the processor to transmitand receive data to and from the processor through various means whichare well known.

It will be apparent to those skilled in the art that the presentinvention can be embodied in other specific forms without departing fromthe spirit and essential characteristics of the invention. Thus, theabove embodiments are to be considered in all respects as illustrativeand not restrictive. The scope of the invention should be determined byreasonable interpretation of the appended claims and all change whichcomes within the equivalent scope of the invention are included in thescope of the invention.

Various embodiments have been described in the best mode for carryingout the invention.

Exemplary embodiments of the present invention can be applied to awireless communication system such as a UE, a relay and a BS.

It will be apparent to those skilled in the art that variousmodifications and variations can be made in the present inventionwithout departing from the spirit or scope of the invention. Thus, it isintended that the present invention cover the modifications andvariations of this invention provided they come within the scope of theappended claims and their equivalents.

What is claimed is:
 1. A method for transmitting an uplink signal by acommunication apparatus in a wireless communication system, the methodcomprising: multiplexing control information in all layers with aplurality of data blocks of the uplink signal; and transmitting theuplink signal to a base station, wherein the number of modulationsymbols per layer for the control information is determined using areciprocal of a sum of spectral efficiencies for respective data blocksof the plurality of data blocks, and wherein a spectral efficiency for adata block is obtained based on a ratio of a size of the data block tothe number of resource elements (REs) for an initial physical uplinkshared channel (PUSCH) transmission of the data block.
 2. The methodaccording to claim 1, wherein, when the plurality of data blocks includea first data block and a second data block, the number of modulationsymbols per layer is determined according to the following equation:$\left\lceil {\frac{{Payload}_{UCI}}{\alpha} \cdot \frac{\lambda_{1} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{intial}} \cdot \lambda_{2} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{intial}}}{\begin{matrix}{{{Payload}_{{Data}\; {(1)}} \cdot \lambda_{2} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{intial}}} +} \\{{Payload}_{{Data}\; {(2)}} \cdot \lambda_{2} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{intial}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}} \right\rceil$ where,Payload_(UCI) is a size of the control information, Payload_(Data(1)) isa size of the first data block, N_(RE) _(_) _(PUSCH(1)) _(initial) isthe number of REs for an initial PUSCH transmission of the first datablock, Payload_(Data(2)) is a size of the second data block, N_(RE) _(_)_(PUSCH(2)) _(initial) is the number of REs for an initial PUSCHtransmission of the second data block, β_(offset) ^(PUSCH) is an offsetvalue, α is an integer of 1 or higher, λ₁ is an integer of 1 or higher,and λ₂ is an integer of 1 or higher, and ┌ ┐ is a ceiling function. 3.The method according to claim 1, wherein N_(RE) _(_) _(PUSCH(i))_(initial) is denoted by N_(RE) _(_) _(PUSCH(i)) _(initial) =M_(sc)^(PUSCH(i)-initial)·N_(symb) ^(PUSCH(i)-initial), and a size of an i-thdata block of the plurality of data blocks is denoted by${\sum\limits_{r = 0}^{C^{(i)} - 1}K_{r}^{(i)}},$ where M_(sc)^(PUSCH(i)-initial) is the number of scheduled subcarriers for aninitial PUSCH transmission of the i-th data block, N_(symb)^(PUSCH(i)-initial) is the number of SC-FDMA symbols for the initialPUSCH transmission of the i-th data block, C^((i)) is the number of codeblocks of the i-th data block, K_(r) ^((i)) is a size of r-th code blockof the i-th data block, and r is an integer of 0 or higher.
 4. Themethod according to claim 2, wherein α=1, λ₁=1, and λ₂=1.
 5. The methodaccording to claim 1, wherein the control information includesacknowledgement/negative acknowledgement (ACK/NACK) or Rank Indicator(RI).
 6. A method for transmitting an uplink signal by a communicationapparatus in a wireless communication system, the method comprising:multiplexing control information with a data block among a plurality ofdata blocks of the uplink signal; and transmitting the uplink signal toa base station, wherein the number of modulation symbols for the controlinformation is determined using a reciprocal of a spectral efficiencyfor the data block, and wherein the spectral efficiency for the datablock is obtained based on a ratio of a size of the data block to thenumber of resource elements (REs) for an initial physical uplink sharedchannel (PUSCH) transmission of the data block.
 7. The method accordingto claim 6, wherein the number of modulation symbols for the controlinformation is determined by the following equation:$\alpha \cdot \left\lceil \frac{{Payload}_{UCI} \cdot N_{{RE}\; \_ \; {{PUSCH}{(x)}}_{intial}} \cdot \beta_{offset}^{PUSCH}}{{Payload}_{{Data}\; {(x)}}} \right\rceil$where α is an integer of 1 or higher, Payload_(UCI) is a size of thecontrol information, Payload_(Data(x)) is a size of the data block,N_(RE) _(_) _(PUSCH(x)) _(initial) is the number of REs for the initialPUSCH transmission of the data block, β_(offset) ^(PUSCH) is an offsetvalue, and ┌ ┐ is a ceiling function.
 8. The method according to claim6, wherein N_(RE) _(_) _(PUSCH(x)) _(initial) is denoted by N_(RE) _(_)_(PUSCH(x)) _(initial) =M_(sc) ^(PUSCH(x)-initial)·N_(symb)^(PUSCH(x)-initial), and a size of the data block is denoted by${\sum\limits_{r = 0}^{C^{(x)} - 1}K_{r}^{(x)}},$ where M_(sc)^(PUSCH(x)-initial) is the number of scheduled subcarriers for theinitial PUSCH transmission of the data block N_(symb)^(PUSCH(x)-initial) is the number of SC-FDMA symbols for the initialPUSCH transmission of the data block, C^((x)) is the number of codeblocks of the data block, K_(r) ^((x)) is a size of r-th code block ofthe data block, and r is an integer of 0 or higher.
 9. The methodaccording to claim 7, wherein α=1.
 10. The method according to claim 6,wherein the control information includes at least one of a ChannelQuality Indicator (CQI) and a Precoding Matrix Indicator (PMI).
 11. Acommunication apparatus configured to transmit an uplink signal in awireless communication system, the communication apparatus comprising: aradio frequency (RF) unit; and a processor configured to multiplexcontrol information in all layers with a plurality of data blocks of theuplink signal, and transmit the uplink signal to a base station throughthe RF unit, wherein the number of modulation symbols per layer for thecontrol information is determined using a reciprocal of a sum ofspectral efficiencies for respective data blocks of the plurality ofdata blocks, and wherein a spectral efficiency for a data block isobtained based on a ratio of a size of the data block to the number ofresource elements (REs) for an initial physical uplink shared channel(PUSCH) transmission of the data block.
 12. The communication apparatusaccording to claim 11, wherein, when the plurality of data blocksinclude a first data block and a second data block, the number ofmodulation symbols per layer is determined according to the followingequation:$\left\lceil {\frac{{Payload}_{UCI}}{\alpha} \cdot \frac{\lambda_{1} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{intial}} \cdot \lambda_{2} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{intial}}}{\begin{matrix}{{{Payload}_{{Data}\; {(1)}} \cdot \lambda_{2} \cdot N_{{RE}\; \_ \; {{PUSCH}{(2)}}_{intial}}} +} \\{{Payload}_{{Data}\; {(2)}} \cdot \lambda_{1} \cdot N_{{RE}\; \_ \; {{PUSCH}{(1)}}_{intial}}}\end{matrix}} \cdot \beta_{offset}^{PUSCH}} \right\rceil$ where,Payload_(UCI) is a size of the control information, Payload_(Data(1)) isa size of the first data block, N_(RE) _(_) _(PUSCH(1)) _(initial) isthe number of REs for an initial PUSCH transmission of the first datablock, Payload_(Data(2)) is a size of the second data block, N_(RE) _(_)_(PUSCH(2)) _(initial) is the number of REs for an initial PUSCHtransmission of the second data block, β_(offset) ^(PUSCH) is an offsetvalue, α is an integer of 1 or higher, λ₁ is an integer of 1 or higher,and λ₂ is an integer of 1 or higher, and ┌ ┐ is a ceiling function. 13.The communication apparatus according to claim 11, wherein N_(RE) _(_)_(PUSCH(i)) _(initial) is denoted by N_(RE) _(_) _(PUSCH(i)) _(initial)=M_(sc) ^(PUSCH(i)-initial)·N_(symb) ^(PUSCH(i)-initial), and a size ofan i-th data block of the plurality of data blocks is denoted by${\sum\limits_{r = 0}^{C^{(i)} - 1}K_{r}^{(i)}},$ where M_(sc)^(PUSCH(i)-initial) is the number of scheduled subcarriers for aninitial PUSCH transmission of the i-th data block, N_(symb)^(PUSCH(i)-initial) is the number of SC-FDMA symbols for the initialPUSCH transmission of the i-th data block, C^((i)) is the number of codeblocks of the i-th data block, K_(r) ^((i)) is a size of r-th code blockof the i-th data block, and r is an integer of 0 or higher.
 14. Thecommunication apparatus according to claim 12, wherein α=1, λ₁=1, andλ₂=1.
 15. The communication apparatus according to claim 11, wherein thecontrol information includes acknowledgement/negative acknowledgement(ACK/NACK) or Rank Indicator (RI).
 16. A communication apparatusconfigured to transmit an uplink signal in a wireless communicationsystem, the communication apparatus comprising: a radio frequency (RF)unit; and a processor configured to multiplex control information with adata block among a plurality of data blocks of the uplink signal, andtransmit the uplink signal to a base station through the RF unit,wherein the number of modulation symbols for the control information isdetermined using a reciprocal of a spectral efficiency for the datablock, and wherein the spectral efficiency for the data block isobtained based on a ratio of a size of the data block to the number ofresource elements (REs) for an initial physical uplink shared channel(PUSCH) transmission of the data block.
 17. The communication apparatusaccording to claim 16, wherein the number of modulation symbols for thecontrol information is determined by the following equation:$\alpha \cdot \left\lceil \frac{{Payload}_{UCI} \cdot N_{{RE}\; \_ \; {{PUSCH}{(x)}}_{intial}} \cdot \beta_{offset}^{PUSCH}}{{Payload}_{{Data}\; {(x)}}} \right\rceil$where α is an integer of 1 or higher, Payload_(UCI) is a size of thecontrol information, Payload_(Data(x)) is a size of the data block,N_(RE) _(_) _(PUSCH(x)) _(initial) is the number of REs for the initialPUSCH transmission of the data block, β_(offset) ^(PUSCH) is an offsetvalue, and ┌ ┐ is a ceiling function.
 18. The communication apparatusaccording to claim 16, wherein N_(RE) _(_) _(PUSCH(x)) _(initial) isdenoted by N_(RE) _(_) _(PUSCH(x)) _(initial) =M_(sc)^(PUSCH(x)-initial)·N_(symb) ^(PUSCH(x)-initial), and a size of the datablock is denoted by ${\sum\limits_{r = 0}^{C^{(x)} - 1}K_{r}^{(x)}},$where M_(sc) ^(PUSCH(x)-initial) is the number of scheduled subcarriersfor the initial PUSCH transmission of the data block N_(symb)^(PUSCH(x)-initial) is the number of SC-FDMA symbols for the initialPUSCH transmission of the data block, C^((x)) is the number of codeblocks of the data block, K_(r) ^((x)) is a size of r-th code block ofthe data block, and r is an integer of 0 or higher.
 19. Thecommunication apparatus according to claim 17, wherein α=1.
 20. Thecommunication apparatus according to claim 16, wherein the controlinformation includes at least one of a Channel Quality Indicator (CQI)and a Precoding Matrix Indicator (PMI).